Name
Abstract | ||
|---|---|---|
We present a ‘Regular Slice Lemma’ which, given a k-graph G, returns a regular (k−1)-complex J with respect to which G has useful regularity properties. We believe that many arguments in extremal hypergraph theory are made considerably simpler by using this lemma rather than existing forms of the Strong Hypergraph Regularity Lemma, and advocate its use for this reason. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.endm.2015.06.093 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Hypergraphs,Regularity Lemma | Aubin–Lions lemma,Discrete mathematics,Combinatorics,Constraint graph,Hypergraph,Five lemma,Pumping lemma for context-free languages,Mathematics,Lemma (mathematics) | Journal |
Volume | ISSN | Citations |
49 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 5 | 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 |