Minimizing the number of independent sets in triangle-free regular graphs

DOI10.1016/j.disc.2017.11.016zbMath1378.05153arXiv1610.05714OpenAlexW2535819116MaRDI QIDQ1690246

Jonathan Cutler, Andrew John Radcliffe

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

independent setshard-core modeloccupancy fraction

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Maximizing the number of independent sets in claw-free cubic graphs ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ Counting independent sets in cubic graphs of given girth ⋮ Independence polynomials of bipartite graphs

Cites Work

• Unnamed Item
• A note on the independence number of triangle-free graphs. II
• The maximum number of complete subgraphs in a graph with given maximum degree
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The Number of Independent Sets in a Regular Graph
• Some Ramsey-Type Numbers and the Independence Ratio
• Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
• On the average size of independent sets in triangle-free graphs
• On weighted graph homomorphisms
• Independent sets, matchings, and occupancy fractions

This page was built for publication: Minimizing the number of independent sets in triangle-free regular graphs