Tight bounds on the coefficients of partition functions via stability

DOI10.1016/j.jcta.2018.06.005zbMath1394.05059OpenAlexW2607573295WikidataQ129651121 ScholiaQ129651121MaRDI QIDQ5915725

Barnaby Roberts, Matthew Jenssen, Ewan Davies, Will Perkins

Publication date: 7 September 2018

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: http://eprints.lse.ac.uk/84154/1/Davies_Tight%20bounds%20on%20the%20coefficients_2017.pdf

zbMATH Keywords

stabilitypartition functionsmatching polynomialindependence polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs ⋮ A proof of the upper matching conjecture for large graphs ⋮ Counting proper colourings in 4-regular graphs via the Potts model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics of the upper matching conjecture
• An analytic approach to stability
• On the measure of intersecting families, uniqueness and stability
• On the number of matchings in regular graphs
• Matchings and independent sets of a fixed size in regular graphs
• Minimizing the number of independent sets in triangle-free regular graphs
• Counting independent sets in cubic graphs of given girth
• Recurrence of distributional limits of finite planar graphs
• Stability theorems for cancellative hypergraphs
• The maximum number of complete subgraphs in a graph with given maximum degree
• Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• Entropy, independent sets and antichains: A new approach to Dedekind’s problem
• Birthday inequalities, repulsion, and hard spheres
• Structure and stability of triangle-free set systems
• The Number of Independent Sets in a Regular Graph
• Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
• Counting matchings in irregular bipartite graphs and random lifts
• On the average size of independent sets in triangle-free graphs
• On weighted graph homomorphisms
• Independent sets, matchings, and occupancy fractions
• Maximizing the Number of Independent Sets of a Fixed Size
• On the Widom–Rowlinson Occupancy Fraction in Regular Graphs

This page was built for publication: Tight bounds on the coefficients of partition functions via stability