Ma's Nordhaus–Gaddum conjecture for total-rainbow connection number
Statement
Let and be complementary connected graphs with vertices. Ma's conjecture. There exist constants and such that
and this upper bound is tight. This asks for a tight linear Nordhaus–Gaddum-type upper bound for total-rainbow connection number; the source gives no resolution of the conjecture.
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.