Saxton, D; Thomason, Andrew Gordon (Cambridge University PressCombinatorics Probability and Computing, 2016-05-01)
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 ...