Counterexamples to conjectures on the occupancy fraction of graphs
Abstract
The occupancy fraction of a graph is a (normalized) measure on the size of independent sets under the hard-core model, depending on a variable (fugacity) λ. We present a criterion for finding the graph with minimum occupancy fraction among graphs with a fixed order, and disprove five conjectures on the extremes of the occupancy fraction and (normalized) independence polynomial for certain graph classes of regular graphs with a given girth.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.