Regularity lemmas for clustering graphs

DOI10.1016/j.aam.2019.101961zbMath1462.05193OpenAlexW2983880685WikidataQ125057500 ScholiaQ125057500MaRDI QIDQ2020028

Fan R. K. Chung

Publication date: 23 April 2021

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2019.101961

zbMATH Keywords

small world phenomenonclustering graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple algorithm for constructing Szemerédi's regularity partition
• Lower bounds of tower type for Szemerédi's uniformity lemma
• A tight lower bound for Szemerédi's regularity lemma
• Sparse quasi-random graphs
• Decompositions of Triangle-Dense Graphs
• Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
• An arithmetic regularity lemma, associated counting lemma, and applications
• Quasi-random hypergraphs
• Regularity lemmas for hypergraphs and quasi-randomness
• The Algorithmic Aspects of the Regularity Lemma
• Szemerédi’s Regularity Lemma for Sparse Graphs
• Regularity Lemma for k-uniform hypergraphs
• Collective dynamics of ‘small-world’ networks
• Quasi-random graphs