Regularity inheritance in hypergraphs
Combinatorics
2019-01-18 v1
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.
Keywords
Cite
@article{arxiv.1901.05955,
title = {Regularity inheritance in hypergraphs},
author = {Peter Allen and Ewan Davies and Jozef Skokan},
journal= {arXiv preprint arXiv:1901.05955},
year = {2019}
}
Comments
48 pages