A counterexample to the Bollobás–Riordan conjectures on sparse graph limits

DOI10.1017/S0963548321000031WikidataQ123331222 ScholiaQ123331222MaRDI QIDQ5886111

Ashwin Sah, Mehtaab Sawhney, Jonathan Tidor, Yufei Zhao

Publication date: 30 March 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.05272

zbMATH Keywords

metricsrandom graph models

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42)

Related Items

Interview with Yufei Zhao

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Green-Tao theorem: an exposition
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
• A relative Szemerédi theorem
• The primes contain arbitrarily long arithmetic progressions
• Extremal results in sparse pseudorandom graphs
• Metrics for sparse graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs
• An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
• Quasi-random graphs