On a conjecture of Erdős and Simonovits: even cycles
From MaRDI portal
Publication:2439838
DOI10.1007/s00493-013-2863-8zbMath1349.05182arXiv1107.4715OpenAlexW2043856632WikidataQ123193800 ScholiaQ123193800MaRDI QIDQ2439838
Jacques Verstraete, Benjamin Sudakov, Peter Keevash
Publication date: 17 March 2014
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.4715
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (5)
Turán numbers of bipartite graphs plus an odd cycle ⋮ Extremal edge polytopes ⋮ Bipartite-ness under smooth conditions ⋮ Extremal Sidon sets are Fourier uniform, with applications to partition regularity ⋮ A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sur la trialité et certains groupes qui s'en déduisent
- \(H\)-free graphs of large minimum degree
- Eigenvalue bounds for independent sets
- Ramanujan graphs
- Explicit constructions of graphs without short cycles and low density codes
- Graphs from projective planes
- Polarities and \(2k\)-cycle-free graphs
- The Moore bound for irregular graphs
- The size of bipartite graphs with a given girth
- A note on graphs without short even cycles
- Compactness results in extremal graph theory
- Cycles of even length in graphs
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- New asymptotics for bipartite Turán numbers
- On the number of edges of quadrilateral-free graphs
- The chromatic thresholds of graphs
- Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite
- The nonexistence of certain generalized polygons
- On the chromatic number of pentagon-free graphs of large minimum degree
- On the Turán number for the hexagon
- On Arithmetic Progressions of Cycle Lengths in Graphs
- Dense graphs with small clique number
- Über ein Problem von K. Zarankiewicz
- A new series of dense graphs of high girth
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Minimal Regular Graphs of Girths Eight and Twelve
- On Minimal graphs of maximum even girth
- A Note on Bipartite Graphs Without 2 k -Cycles
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
This page was built for publication: On a conjecture of Erdős and Simonovits: even cycles
