Quasi-randomness and the regularity method in hypergraphs

MaRDI QIDQ5371208zbMATH OpenFDO

Authors Vojtěch Rödl

Publication date 25 October 2017

zbMATH Keywords

quasi-randomnessRamsey theoryremoval lemmaSzemerédi's theorem

Mathematics Subject Classification ID

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

Recommendations

• Hypergraph regularity and quasi-randomness
• Regularity lemmas for hypergraphs and quasi-randomness
• Hypergraphs, quasi-randomness, and conditions for regularity
• Regular Partitions of Hypergraphs: Regularity Lemmas
• scientific article; zbMATH DE number 1944144

Cited in

(10)

• Hypergraphs, quasi-randomness, and conditions for regularity
• Short paths in quasi-random triple systems with sparse underlying graphs
• σ-algebras for quasirandom hypergraphs
• Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
• Quasi-random hypergraphs revisited
• The quasi-randomness of hypergraph cut properties
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
• Note on upper density of quasi-random hypergraphs
• Quasirandomness in hypergraphs

This page was built for publication: Quasi-randomness and the regularity method in hypergraphs

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