The Number of Independent Sets in a Graph with Small Maximum Degree

@article{Galvin2011TheNO,
  title={The Number of Independent Sets in a Graph with Small Maximum Degree},
  author={David Galvin and Yufei Zhao},
  journal={Graphs and Combinatorics},
  year={2011},
  volume={27},
  pages={177-186}
}
Let ind(G) be the number of independent sets in a graph G. We show that if G has maximum degree at most 5 then 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

The Number of Independent Sets in a Regular Graph

  • Y. Zhao
  • Combin. Probab. Comput
  • 2010
Highly Influential
7 Excerpts

Independent sets in regular graphs and sum-free subsets of finite groups, Israel

  • N. Alon
  • J. Math
  • 1991
Highly Influential
3 Excerpts

An entropy approach to the hard-core model on bipartite graphs, Combin

  • J. Kahn
  • Probab. Comput
  • 2001
3 Excerpts

Alon , Independent sets in regular graphs and sumfree subsets of finite groups

  • N.
  • Israel J . Math .
  • 1991

Similar Papers

Loading similar papers…