Chartrand et al.'s odd-order maximum-size conjecture for rainbow disconnection number
Statement
Let be a connected graph of order , and let be its rainbow disconnection number, the minimum number of colors needed in an edge-coloring so that every pair of vertices is separated by a rainbow edge-cut. Let and be integers with , and suppose that is odd.
Chartrand et al.'s conjecture. The maximum size of a connected graph of order with is
This is the odd-order maximum-size question left by the earlier determination of the corresponding minimum size. The paper presents the result as a conjecture posed by Chartrand et al. and states elsewhere that it solves 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.