Chartrand's existence conjecture for prescribed rainbow connection numbers
Statement
Let be a connected graph, and let and denote its rainbow connection number and strong rainbow connection number, respectively. Let and be positive integers. Chartrand's conjecture. There exists a connected graph such that and if and only if or . The conjecture asks whether the lower bound on in the preceding existence theorem can be removed; it was subsequently confirmed by Chen and Li, who constructed graphs with the prescribed parameters.
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.