Simple containers for simple hypergraphs
  We give an easy method for constructing containers for 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. 
David Saxton and Andrew Thomason
math.CO