ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. For vertices u,vu,v and an integer aa, let na(u,v)n_a(u,v) be the number of vertices whose distance difference relative to uu and vv equals aa. Call GG NT-balanced when na(u,v)=na(v,u)n_a(u,v)=n_a(v,u) for every pair of vertices u,vu,v and every relevant integer aa. Call it ultra NT-balanced when, for every pair u,vu,v, there is an involution of the vertex set pairing vertices counted by na(u,v)n_a(u,v) with vertices counted by na(v,u)n_a(v,u).

NT-balance equivalence conjecture. Every NT-balanced graph is also ultra NT-balanced.

The paper proves that ultra NT-balanced graphs are closed under Cartesian products and uses this to construct arbitrarily large examples. Whether every NT-balanced graph admits the required involutions remains open.

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.