Journal article icon

Journal article

Independent sets in graphs with given minimum degree

Abstract:
We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when the number $n$ 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.

Actions


Authors


McDiarmid, C More by this author
Publication date:
2012-10-04
URN:
uuid:7120f578-4fb8-4225-a036-36c6b7c1a496
Source identifiers:
365267
Local pid:
pubs:365267
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP