The edge-statistics conjecture for \(\ell \ll k^{6/5} \)

DOI10.1007/s11856-019-1929-8zbMath1429.05106arXiv1809.02576OpenAlexW2972785243WikidataQ122941003 ScholiaQ122941003MaRDI QIDQ2279950

Frank Mousset, Miloš Trujić, Andreas Noever, Anders Martinsson

Publication date: 17 December 2019

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

anti-concentrationRamsey-type arguments

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

Cites Work

• The inducibility of blow-up graphs
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• The inducibility of graphs
• A bound on the inducibility of cycles
• On the exact maximum induced density of almost all graphs and their inducibility
• Anticoncentration for subgraph statistics
• On the inducibility of cycles

This page was built for publication: The edge-statistics conjecture for \(\ell \ll k^{6/5} \)