On the non-(p-1)-partite K_{p}-free graphs

DOI10.7151/dmgt.1654zbMath1291.05095OpenAlexW2059872504MaRDI QIDQ2866445

Kinnari Amin, Ronald J. Gould, Elżbieta Sidorowicz, Jill R. Faudree

Publication date: 13 December 2013

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1654

zbMATH Keywords

extremal problems\(K_p\)-saturated graphsmaximal \(K_p\)-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (18)

Making K_r+1-free graphs r-partite ⋮ Saturation spectrum of paths and stars ⋮ Turán numbers for 3-uniform linear paths of length 3 ⋮ Gaps in the saturation spectrum of trees ⋮ Singular Turán numbers and worm-colorings ⋮ Refinement on Spectral Turán’s Theorem ⋮ Some position problems for graphs ⋮ Rainbow Saturation for Complete Graphs ⋮ On the saturation spectrum of families of cycle subdivisions ⋮ Some exact results for regular Turán problems for all large orders ⋮ On fan-saturated graphs ⋮ On \((\mathrm{K}_t-e)\)-saturated graphs ⋮ Strong Turán stability ⋮ Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ Strong Turán stability ⋮ The edge spectrum of \(K_4^-\)-saturated graphs ⋮ A stability theorem for maximal \(K_{r+1}\)-free graphs ⋮ Exact stability for Turán’s Theorem

This page was built for publication: On the non-(p-1)-partite K_{p}-free graphs