A note on Turán numbers for even wheels

DOI10.1007/s00373-012-1212-9zbMath1272.05085OpenAlexW2039853098MaRDI QIDQ367087

Tomasz Dzido

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1212-9

zbMATH Keywords

cyclesTurán problem

Mathematics Subject Classification ID

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

Related Items

Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels ⋮ The maximum spectral radius of wheel-free graphs ⋮ Extremal \(H\)-free planar graphs ⋮ A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs ⋮ Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order ⋮ On the Turán number of \(K_m \vee C_{2k-1}\) ⋮ Turán numbers for odd wheels ⋮ Spectral extremal problem on disjoint color-critical graphs ⋮ Extremal Numbers for Odd Cycles ⋮ A note on the Turán number of disjoint union of wheels ⋮ The lower and upper bounds of Turán number for odd wheels ⋮ On the Turán number of theta graphs

Cites Work

• Maximal cycles in graphs
• Ramsey Numbers Involving Cycles
• Sufficient Conditions for Circuits in Graphs^†
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item