A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Turán's theorem andk-connected graphs
2008
Journal of Graph Theory
The minimum size of a k-connected graph with given order and stability number is investigated. If no connectivity is required, the answer is given by Turán's Theorem. For connected graphs, the problem has been solved recently independently by Christophe et al., and by Gitler and Valencia. In this paper, we give a short proof of their result and determine the extremal graphs. We settle the case of 2-connected graphs, characterize the corresponding extremal graphs, and also extend a result of
doi:10.1002/jgt.20289
fatcat:xebzk5w2srfblmpvhzgntl4hwi