ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph of order nn, and let rd(G)rd(G) 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 kk and nn be integers with 1≤k≤n−11\leq k\leq n-1, and suppose that n≥5n\geq 5 is odd.

Chartrand et al.'s conjecture. The maximum size of a connected graph GG of order nn with rd(G)=krd(G)=k is

(k+1)(n−1)2.\frac{(k+1)(n-1)}{2}.

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 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.