Name
Abstract | ||
|---|---|---|
We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these subcomplexes capture many important structural properties of the original hypergraph. Accordingly we advocate their use in extremal hypergraph theory, and explain how they can lead to considerable simplifications in existing proofs in this field. We also use them for establishing the following two new results. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.jcta.2017.01.003 | Journal of Combinatorial Theory, Series A |
Keywords | Field | DocType |
Hypergraphs,Cycles,Regularity | Discrete mathematics,Combinatorics,Vertex (geometry),Hypergraph,Constraint graph,Mathematical proof,Mathematics,Lemma (mathematics) | Journal |
Volume | ISSN | Citations |
149 | 0097-3165 | 4 |
PageRank | References | Authors |
0.50 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Allen | 1 | 56 | 9.72 |
| Julia Böttcher | 2 | 93 | 17.35 |
| Oliver Cooley | 3 | 39 | 9.15 |
| Richard Mycroft | 4 | 74 | 9.33 |