Independent sets in graphs with given minimum degree
Combinatorics
2012-10-05 v1
Abstract
We consider numbers and sizes of independent sets in graphs with minimum degree at least , when the number of vertices is large. 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.
Cite
@article{arxiv.1210.1497,
title = {Independent sets in graphs with given minimum degree},
author = {Hiu-Fai Law and Colin McDiarmid},
journal= {arXiv preprint arXiv:1210.1497},
year = {2012}
}