Sah–Sawhney–Stoner–Zhao conjecture on antiferromagnetic homomorphism maxima
Sah–Sawhney–Stoner–Zhao conjecture on antiferromagnetic homomorphism maxima
Let be a -regular graph, and let be a graph possibly with loops. Regard as its symmetric adjacency matrix, and suppose that it has at most one positive eigenvalue. Sah–Sawhney–Stoner–Zhao conjecture. Then
This would generalize the Kahn–Zhao theorem and the corresponding result for complete target graphs, asserting that complete bipartite graphs maximize normalized homomorphism counts from regular graphs under the stated spectral condition. The conjecture is presented as open in the paper.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Joonkyung Lee, Jaeseong Oh and Jaehyeon Seo, “Counting homomorphisms in antiferromagnetic graphs via Lorentzian polynomials”, arXiv:2506.13659 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.