Independent sets in graphs with given minimum degree

James Alexander, Jonathan Cutler, Tim Mink

Research output: Contribution to journalArticle

11 Scopus citations

Abstract

The enumeration of independent sets in graphs with various restrictions has been a topic of much interest of late. Let i(G) be the number of independent sets in a graph G and let i t(G) be the number of independent sets in G of size t. Kahn used entropy to show that if G is an r-regular bipartite graph with n vertices, then i(G) ≤ i(K r,r) n/2r. Zhao used bipartite double covers to extend this bound to general r-regular graphs. Galvin proved that if G is a graph with δ(G) ≥ δ and n large enough, then i(G) ≤ i(K δ,n-δ). In this paper, we prove that if G is a bipartite graph on n vertices with δ(G) ≥ δ where n ≥ 2δ, then i t(G) ≤ i t(K δ,n-δ) when t ≥ 3. We note that this result cannot be extended to t = 2 (and is trivial for t = 0, 1). Also, we use Kahn's entropy argument and Zhao's extension to prove that if G is a graph with n vertices, δ(G) ≥ δ, and Δ(G) ≤ Δ, then i(G) ≤ i(K δ;≥) n/2δ.

Original languageEnglish
JournalElectronic Journal of Combinatorics
Volume19
Issue number3
StatePublished - 27 Sep 2012

Fingerprint Dive into the research topics of 'Independent sets in graphs with given minimum degree'. Together they form a unique fingerprint.

  • Cite this