A probabilistic counting lemma for complete graphs

DOI10.1002/rsa.20198zbMath1137.05067OpenAlexW4239858581WikidataQ124814834 ScholiaQ124814834MaRDI QIDQ5433274

Angelika Steger, Stefanie Gerke, Martin Marciniszyn

Publication date: 8 January 2008

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01184453/file/dmAE0161.pdf

zbMATH Keywords

counting lemmasparse graphSzemerédi regularityTurán's problem in random graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items (4)

A new proof of the KŁR conjecture ⋮ Extremal results in sparse pseudorandom graphs ⋮ On the KŁR conjecture in random graphs ⋮ Asymmetric Ramsey properties of random graphs involving cliques

Cites Work

• Szemerédi’s Regularity Lemma for Sparse Graphs
• Unnamed Item

This page was built for publication: A probabilistic counting lemma for complete graphs