Antiferromagnetic models as clique-minimisers
Antiferromagnetic models as clique-minimisers
Let be a graph, let , and let be an edge-weighted graph, possibly with loops. Define the weighted homomorphism count by
where is the edge weight between and . Call antiferromagnetic if its symmetric edge-weight matrix has exactly one positive eigenvalue, counting multiplicity. The antiferromagnetic clique-minimiser conjecture. For every graph and every antiferromagnetic edge-weighted graph ,
This conjecture would extend the lower bound for multivariate independence polynomials and its two-spin corollary to all antiferromagnetic homomorphism models. It is established in the paper for the relevant two-spin models, but the general antiferromagnetic case remains open.
Progress summary
The broad conjecture remains open, with a February 2026 paper proving only important special cases.
The conjecture asserts a universal lower bound for weighted homomorphism counts into every antiferromagnetic target graph. Its general form is explicitly left as Conjecture in the latest retrieved paper.
Known results
- The multivariate independence-polynomial and two-spin cases follow from Theorems and .
- The bound is proved for targets and .
February 2026 partial progress
The paper “Lower bounds for multivariate independence polynomials and their generalisations” develops further vertex-weighted results for and describes them as partial progress toward Conjecture . It also says the authors independently rewrote selected arguments whose statements were suggested by an unnamed model; this is not a model-produced proof of the conjecture.
Current status (as of August 2026): The general antiferromagnetic clique-minimiser conjecture remains open; the February 2026 paper establishes only the stated special cases and partial results.
Sources
Sources & referencesView supporting material
Primary source
Joonkyung Lee and Jaehyeon Seo, “Lower bounds for multivariate independence polynomials and their generalisations”, arXiv:2602.02450 (2026).
Solutions 1
Sign in to submit a solution.
Joonkyung Lee and I just uploaded a proof to arXiv: see https://arxiv.org/abs/2608.17920 .