| dc.creator | Saxton, D | |
| dc.creator | Thomason, Andrew Gordon | |
| dc.date.accessioned | 2015-01-09 | |
| dc.date.accessioned | 2018-11-24T23:27:31Z | |
| dc.date.available | 2017-09-12T11:36:57Z | |
| dc.date.available | 2018-11-24T23:27:31Z | |
| dc.date.issued | 2016-05-01 | |
| dc.identifier | https://www.repository.cam.ac.uk/handle/1810/267173 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/123456789/3995 | |
| dc.description.abstract | We give an easy method for constructing containers for simple hypergraphs. The method also has consequences for non-simple hypergraphs. Some applications are given; in particular, a very transparent calculation is offered for the number of H-free hypergraphs, where H is some fixed uniform hypergraph. | |
| dc.language | en | |
| dc.publisher | Cambridge University Press | |
| dc.publisher | Combinatorics Probability and Computing | |
| dc.title | Simple Containers for Simple Hypergraphs | |
| dc.type | Article | |
