A completion of the proof of the Edge-statistics Conjecture

DOI10.19086/aic.12047zbMath1450.05094arXiv1809.01352OpenAlexW3008018122WikidataQ123358607 ScholiaQ123358607MaRDI QIDQ5126755

Jacob Fox, Lisa Sauermann

Publication date: 20 October 2020

Published in: Advances in Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

inducibilityedge-statistics

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (5)

Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Combinatorial anti-concentration inequalities, with applications ⋮ Proof of a conjecture on induced subgraphs of Ramsey graphs ⋮ Edge-statistics on large graphs ⋮ The feasible region of induced graphs

This page was built for publication: A completion of the proof of the Edge-statistics Conjecture