Simple Containers for Simple Hypergraphs
Accepted version
Peer-reviewed
Repository URI
Repository DOI
Change log
Authors
Saxton, D
Thomason, A
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.
Description
Keywords
math.CO, math.CO
Journal Title
Combinatorics Probability and Computing
Conference Name
Journal ISSN
0963-5483
1469-2163
1469-2163
Volume Title
25
Publisher
Cambridge University Press