Li and Magnant's diameter-three proper connection conjecture
Statement
Let be a 2-connected noncomplete graph, and let denote its diameter. Let denote the minimum number of colors in an edge-coloring such that every pair of distinct vertices is joined by a proper path. Li and Magnant's conjecture. If
then
The claim proposes a sharp two-color bound for proper connection in this class of 2-connected graphs; its status is not established by the supplied text.
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.