Li et al.'s conjecture on rainbow connection and vertex connectivity
Statement
Let be a -connected graph on vertices.
Li et al.'s conjecture. There exists a constant such that
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.