ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph, and let rc(G)rc(G) and src(G)src(G) denote its rainbow connection number and strong rainbow connection number, respectively. Let aa and bb be positive integers. Chartrand's conjecture. There exists a connected graph GG such that rc(G)=arc(G)=a and src(G)=bsrc(G)=b if and only if a=b∈{1,2}a=b\in\{1,2\} or 3≤a≤b3\leq a\leq b. The conjecture asks whether the lower bound on bb 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 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.