Nicolas Bougard

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1