Counting homomorphisms in antiferromagnetic graphs via Lorentzian polynomials

Joonkyung Lee, Jaeseong Oh, Jaehyeon Seo

An edge-weighted graph $G$, possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The num…