Regularity inheritance in hypergraphs

Abstract

We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular partitions of sparse hypergraphs. We also prove a corresponding sparse hypergraph regularity lemma.

arXiv comment48 pages

References in corpus (3)

• Extremal results in sparse pseudorandom graphs
• A relative Szemerédi theorem
• Regularity inheritance in pseudorandom graphs

Cited by in corpus (1)

• Resilience for tight Hamiltonicity