The rainbow vertex-disconnection Nordhaus–Gaddum conjecture
Statement
Let and be nontrivial connected graphs of order . Write for the rainbow vertex-disconnection number of . Rainbow vertex-disconnection Nordhaus–Gaddum conjecture.
This conjecture proposes an improvement of the established lower bound for the sum of the rainbow vertex-disconnection numbers of a graph and its complement. The paper notes that the bound holds when , but does not establish it for all nontrivial connected graphs of order at least .
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.