On a conjecture of Erdős and Simonovits: even cycles

DOI10.1007/s00493-013-2863-8zbMath1349.05182arXiv1107.4715MaRDI QIDQ2439838

Jacques Verstraete, Peter Keevash, Benjamin Sudakov

Publication date: 17 March 2014

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

even cycles; Turán number; \(\mathcal F\)-free graph

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)