Article contents
On Independent Sets in Graphs with Given Minimum Degree
Published online by Cambridge University Press: 16 September 2013
Abstract
We consider numbers and sizes of independent sets in graphs with minimum degree at least d. In particular, we investigate which of these graphs yield the maximum numbers of independent sets of different sizes, and which yield the largest random independent sets. We establish a strengthened form of a conjecture of Galvin concerning the first of these topics.
Keywords
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2013
References
- 5
- Cited by