Simple containers for simple hypergraphs
Combinatorics
2019-02-20 v1
Abstract
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.
Cite
@article{arxiv.1402.5400,
title = {Simple containers for simple hypergraphs},
author = {David Saxton and Andrew Thomason},
journal= {arXiv preprint arXiv:1402.5400},
year = {2019}
}
Comments
10 pages