On the Turán number for the hexagon

DOI10.1016/j.aim.2005.04.011zbMath1094.05032OpenAlexW2052325621WikidataQ56698340 ScholiaQ56698340MaRDI QIDQ2497327

Assaf Naor, Jacques Verstraete, Zoltan Fueredi

Publication date: 4 August 2006

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

Full work available at URL: https://doi.org/10.1016/j.aim.2005.04.011

zbMATH Keywords

Turán numbersextremal graph theoryexcluded cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (26)

The number of \(C_{2\ell}\)-free graphs ⋮ Making a \(C_6\)-free graph \(C_4\)-free and bipartite ⋮ Graphs without theta subgraphs ⋮ ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE ⋮ On the Turán number of some ordered even cycles ⋮ The minimum degree of minimal Ramsey graphs for cliques ⋮ On subgraphs of \(C_{2k}\)-free graphs ⋮ Kernelization for cycle transversal problems ⋮ Extremal results for \(C_3^-\)-free signed graphs ⋮ A Bound on the Number of Edges in Graphs Without an Even Cycle ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ Turán numbers for disjoint copies of graphs ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ On monomial graphs of girth eight ⋮ Bipartite algebraic graphs without quadrilaterals ⋮ A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints ⋮ A variation of the Erdős-Sós conjecture in bipartite graphs ⋮ Generalized multiplicative Sidon sets ⋮ Multi-color Ramsey numbers of even cycles ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) ⋮ An improved upper bound for the size of the multiplicative 3-Sidon sets ⋮ On subgraphs of C_2k-free graphs and a problem of Kühn and Osthus ⋮ Turán numbers of theta graphs ⋮ A note on the Turán function of even cycles ⋮ Spectral extrema of graphs: forbidden hexagon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polarities and \(2k\)-cycle-free graphs
• The Moore bound for irregular graphs
• \(C_ 6\)-free bipartite graphs and product representation of squares
• The size of bipartite graphs with a given girth
• Compactness results in extremal graph theory
• Sparse quasi-random graphs
• The nonexistence of certain generalized polygons
• The Difference Between Consecutive Primes, II
• On maximal paths and circuits of graphs
• Four-cycles in graphs without a given even cycle
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: On the Turán number for the hexagon