Regularity, uniformity, and quasirandomness

DOI10.1073/pnas.0503263102zbMath1191.05057OpenAlexW2027453144WikidataQ33852254 ScholiaQ33852254MaRDI QIDQ5385860

József Solymosi

Publication date: 7 May 2008

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://europepmc.org/articles/pmc1149446

zbMATH Keywords

hypergraph regularity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (2)

Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Generalizations of the removal lemma

Cites Work

• An ergodic Szemerédi theorem for commuting transformations
• Quasi‐random classes of hypergraphs
• Extremal problems on set systems
• The hypergraph regularity method and its applications
• A new proof of Szemerédi's theorem

This page was built for publication: Regularity, uniformity, and quasirandomness