ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and G‾\overline{G} be nontrivial connected graphs of order n≥8n\geq 8. Write rvd(G)rvd(G) for the rainbow vertex-disconnection number of GG. Rainbow vertex-disconnection Nordhaus–Gaddum conjecture.

rvd(G)+rvd(G‾)≥n.rvd(G)+rvd(\overline{G})\geq n.

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 rvd(G)=1rvd(G)=1, but does not establish it for all nontrivial connected graphs of order at least 88.

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.