Simple Containers for Simple Hypergraphs
DAVID SAXTON, ANDREW THOMASON · Combinatorics Probability Computing · 2015
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.