Antiferromagnetic homomorphism inequalities conjectures
Statement
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.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.