Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1017/S096354831500022X | COMBINATORICS PROBABILITY & COMPUTING |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Constraint graph,Hypergraph,Mathematics | Journal | 25 |
Issue | ISSN | Citations |
3 | 0963-5483 | 2 |
PageRank | References | Authors |
0.38 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Saxton | 1 | 13 | 3.15 |
| Andrew Thomason | 2 | 71 | 16.01 |