The number of independent sets in a graph with small maximum degree

DOI10.1007/s00373-010-0976-zzbMath1235.05104arXiv1007.4803OpenAlexW2111038853MaRDI QIDQ659691

David Galvin, Yufei Zhao

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.4803

zbMATH Keywords

Stable setIndependent setRegular graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Extremal Regular Graphs: Independent Sets and Graph Homomorphisms ⋮ Independent sets in graphs ⋮ Hölder-type inequalities and their applications to concentration and correlation bounds ⋮ Counting MSTD sets in finite abelian groups ⋮ The number of independent sets in an irregular graph ⋮ A reverse Sidorenko inequality ⋮ Extremal H‐Colorings of Graphs with Fixed Minimum Degree

Cites Work

• Independent sets in regular graphs and sum-free subsets of finite groups
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The Number of Independent Sets in a Regular Graph

This page was built for publication: The number of independent sets in a graph with small maximum degree