Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.

zbMath1088.05038MaRDI QIDQ2488527

Mihyun Kang, Oleg Pikhurko

Publication date: 24 May 2006

Published in: Matematychni Studiï (Search for Journal in Brave)

zbMATH Keywords

extremal graphsTurán's theoremmaximum sizeshortest odd cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (8)

Making K_r+1-free graphs r-partite ⋮ Singular Turán numbers and worm-colorings ⋮ Refinement on Spectral Turán’s Theorem ⋮ Some exact results for regular Turán problems for all large orders ⋮ Strong Turán stability ⋮ Strong Turán stability ⋮ A stability theorem for maximal \(K_{r+1}\)-free graphs ⋮ Exact stability for Turán’s Theorem

This page was built for publication: Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.