Antiferromagnetic homomorphism inequalities conjectures
Antiferromagnetic homomorphism inequalities conjectures
Let be a finite edge-weighted graph, possibly with loops, whose adjacency matrix is entrywise nonnegative and has at most one positive eigenvalue, counted with multiplicity. Then, for every finite graph , with for each , one has . Here is the weighted homomorphism count.
Progress summary
A new preprint proves the unified inequality for every antiferromagnetic target, apparently settling the tracked conjectures.
The conjectures concern lower bounds for homomorphism counts to antiferromagnetic targets, encompassing extremal statements about independent sets, colorings, and semiproper colorings. The central target inequality appears as Conjecture 1.3 in the February 2026 work.
Known results
- The case was previously settled through a generalization of Csikvári’s inequality, as recorded in Zhao’s survey.
- The conjecture was known for and for the target .
- Sah--Sawhney--Stoner--Zhao-type coloring inequalities were proved for several blow-ups of bipartite graphs, including paths, even cycles, and complete multipartite graphs (2025).
- For , proper -colorings of -regular graphs were shown to be maximized by unions of (2018).
August 2026 theorem
Lee, Joonkyung, Seo, and Jaehyeon prove a vertex-inhomogeneous homomorphism inequality for every antiferromagnetic target. The abstract says this unifies the relevant independent-set, coloring, and semiproper-coloring inequalities; it is a corroborated preprint result, not merely an announcement.
Current status (as of August 2026): The unified antiferromagnetic-target inequality is proved in a preprint, apparently resolving the tracked conjectures, although the exact correspondence with every formulation is not specified in the supplied abstract.
Sources
Sources & referencesView supporting material
Primary source
Additional references
- Antiferromagnetic models are clique-minimizing — arXiv — Lee, Joonkyung, Seo, Jaehyeon
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.