On the non-(p-1)-partite K_{p}-free graphs
Kinnari Amin, Jill Faudree, Ronald J. Gould, Elżbieta Sidorowicz · Discussiones Mathematicae Graph Theory · 2012
We say that a graph G is maximal K p -free if G does not contain K p but if we add any new edge e ∈ E(G) to G, then the graph G + e contains K p .We study the minimum and maximum size of non-(p -1)-partite maximal K p -free graphs with n vertices.We also answer the interpolation question: 10