Is it easy to regularize a hypergraph with easy links?

DOI10.1093/IMRN/RNAG018MaRDI QIDQ6853974zbMATH OpenFDO

Authors Lior Gishboliner, Asaf Shapira, Yuval Wigderson

Publication date 25 February 2026

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1093/IMRN/RNAG018

zbMATH Keywords

\(\varepsilon\)-regular partitionsregular partitions of tower-type size

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
• A semi-algebraic version of Zarankiewicz's problem
• A short proof of Gowers' lower bound for the regularity lemma
• An exact result for 3-graphs
• Bounded VC-dimension implies the Schur-Erdős conjecture
• Definable regularity lemmas for NIP hypergraphs
• Density and regularity theorems for semi-algebraic hypergraphs
• Efficient arithmetic regularity and removal lemmas for induced bipartite patterns
• Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
• Erdős-Hajnal conjecture for graphs with bounded VC-dimension
• Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets
• HIGH DIMENSIONAL EXPANDERS
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 3407723 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Independent sets in hypergraphs with a forbidden link
• Induced Ramsey-type theorems
• Lower bounds of tower type for Szemerédi's uniformity lemma
• On the Zarankiewicz problem for graphs with bounded VC-dimension
• On universality of graphs with uniformly distributed edges
• p-adic curvature and the cohomology of discrete subgroups of p-adic groups
• Quantitative structure of stable sets in finite abelian groups
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Ramsey-type results for semi-algebraic relations
• Regularity lemma for distal structures
• Regularity lemmas for hypergraphs and quasi-randomness
• Regularity partitions and the topology of graphons
• Structure and regularity for subsets of groups with finite VC-dimension
• The Algorithmic Aspects of the Regularity Lemma
• The hypergraph regularity method and its applications
• The probabilistic method
• Weak hypergraph regularity and linear hypergraphs
• Weak quasi-randomness for uniform hypergraphs

This page was built for publication: Is it easy to regularize a hypergraph with easy links?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6853974)