On the non-(p-1)-partite K_p-free graphs

DOI10.7151/DMGT.1654MaRDI QIDQ2866445zbMATH OpenOpenAlexFDO

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

Publication date 13 December 2013

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• A stability theorem for maximal \(K_{r+1}\)-free graphs
• Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• scientific article; zbMATH DE number 2197878
• A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs

Cited in

(19)

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

This page was built for publication: On the non-\((p-1)\)-partite \(K_p\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866445)