The number of independent sets in a graph with small maximum degree
From MaRDI portal
Publication:659691
DOI10.1007/s00373-010-0976-zzbMath1235.05104arXiv1007.4803MaRDI QIDQ659691
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
05C30: Enumeration in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Extremal Regular Graphs: Independent Sets and Graph Homomorphisms, Extremal H‐Colorings of Graphs with Fixed Minimum Degree, Independent sets in graphs, Hölder-type inequalities and their applications to concentration and correlation bounds, Counting MSTD sets in finite abelian groups, A reverse Sidorenko inequality, The number of independent sets in an irregular graph
Cites Work