ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a graph and xx a vertex. Define Hx(k)H_x(k) to be the subgraph induced by all vertices at distance at most kk from xx; for vertex-transitive HH, write this graph as H(k)H(k). Say that a graph HH dominates a graph H′H' when

tH(W)1/e(H)≥tH′(W)1/e(H′)t_H(W)^{1/e(H)}\geq t_{H'}(W)^{1/e(H')}

for every graphon WW.

Neighborhood domination conjecture. If HH is a vertex-transitive reflection graph with diameter dd, then H(ℓ)H(\ell) dominates H(k)H(k) for all 1≤k≤ℓ≤d1\leq k\leq \ell\leq d.

The conjecture proposes a monotonicity principle for domination inequalities among metric neighborhoods in vertex-transitive reflection graphs. The supplied source gives no evidence of a resolution.

Record

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.