ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a κ\kappa-connected graph on nn vertices.

Li et al.'s conjecture. There exists a constant CC such that

rc(G)<nκ+C.rc(G) < \frac{n}{\kappa} + C.

This conjecture seeks a tight upper bound for the rainbow connection number in terms of vertex connectivity. The surrounding discussion records related bounds, including an asymptotic result and a bound for graphs of high girth, but does not state that this conjecture has been resolved.

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.