On the growth of weak regular partitions in k-uniform hypergraphs
math.CO, math.LO
Submitted: 2026-10-31
Updated: 2026-10-31
Comments: Contains some overlap in definitions and background with the paper on the 3-uniform case, which this paper generalizes (arXiv:2404.01293)
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Stable regularity for relational structures
- Definable regularity lemmas for NIP hypergraphs
- Regularity lemma for distal structures
- Hypergraph regularity and higher arity VC-dimension
- A tight lower bound for Szemer'edi's regularity lemma
- Erdos-Hajnal conjecture for graphs with bounded VC-dimension
- A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing
- Is it easy to regularize a hypergraph with easy links?
- Regularity for hypergraphs with bounded VC$_2$ dimension
- A Guide to NIP theories
- Growth of regular partitions 4: strong regularity and the pairs partition
- Growth of regular partitions 3: strong regularity and the vertex partition
- Growth of regular partitions 2: Weak regularity
- Irregular triads in 3-uniform hypergraphs
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality