On the size of graphs with complete‐factors
Jin Akiyama, Péter Frankl · Journal of Graph Theory · 1985
Abstract A spanning subgraph H of a graph G is called a Kl‐factor if each component of H is isomorphic to the complete graph of order l. We determine the minimum size for any graph to have a Kl‐factor. Relating this result, we give a new short proof of the Erdös‐Gallai theorem on the maximum size of graphs with at most β independent edges.