The eventual non-ℓ-distance-balance conjecture for generalized Petersen graphs
Statement
Let be the generalized Petersen graph, let denote graph distance, and let be its diameter. For an integer , define
The eventual non--distance-balance conjecture. For any , the graph is not -distance-balanced for any integer with . Moreover, is the smallest integer with this property. The conjecture formalizes computational evidence that, for each fixed , sufficiently large generalized Petersen graphs are diameter-distance-balanced but fail to be -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.