On the size of graphs with complete‐factors
Authors:
- 1 March 1985
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 9 (1) , 197-201
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.Keywords
This publication has 1 reference indexed in Scilit:
- GRAPH THEORY1969