Work

Regularity inheritance in hypergraphs

Year: 2019

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1901.05955

Authors: Allen, Peter, Davies, Ewan, Skokan, Jozef

Institutions: London School of Economics and Political Science, University of California, Berkeley, University of Illinois Urbana-Champaign

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Engineering and Physical Sciences Research Council

Awards: Sparse Discrete Structures, The sparse hypergraph regularity method

OpenAlex ID: W2909726837

Cites: 22

Cited by: 3

Related to: 20