ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a finite edge-weighted graph, possibly with loops, whose adjacency matrix AHA_H is entrywise nonnegative and has at most one positive eigenvalue, counted with multiplicity. Then, for every finite graph GG, with dv=deg⁡G(v)d_v=\deg_G(v) for each v∈V(G)v\in V(G), one has hom⁡(G,H)≥∏v∈V(G)hom⁡(Kdv+1,H)1dv+1\operatorname{hom}(G,H)\geq\prod_{v\in V(G)}\operatorname{hom}(K_{d_v+1},H)^{\frac{1}{d_v+1}}. Here hom⁡(G,H)=∑ϕ:V(G)→V(H)∏uv∈E(G)AH(ϕ(u),ϕ(v))\operatorname{hom}(G,H)=\sum_{\phi:V(G)\to V(H)}\prod_{uv\in E(G)}A_H(\phi(u),\phi(v)) is the weighted homomorphism count.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.