ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GP(n,k)GP(n,k) be the generalized Petersen graph, let dd denote graph distance, and let DD be its diameter. For an integer k≥2k\geq 2, define

nk={11,k=2,(k+1)2,k odd,k(k+2),k≥4 even.n_k=\begin{cases}11,&k=2,\\(k+1)^2,&k\text{ odd},\\k(k+2),&k\geq4\text{ even}. \end{cases}

The eventual non-ℓ\ell-distance-balance conjecture. For any n>nkn>n_k, the graph GP(n,k)GP(n,k) is not ℓ\ell-distance-balanced for any integer ℓ\ell with 1≤ℓ<D1\leq\ell<D. Moreover, nkn_k is the smallest integer with this property. The conjecture formalizes computational evidence that, for each fixed kk, sufficiently large generalized Petersen graphs are diameter-distance-balanced but fail to be ℓ\ell-distance-balanced at every smaller distance.

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.