ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a distance-hereditary graph. A big-μ\mu cograph without universal vertices is a cograph of the form G=(K1∪Kt)+HG=(K_1\cup K_t)+H without universal vertices, as described in the preceding characterization. Mutual-visibility conjecture. If GG is a distance-hereditary graph but not a big-μ\mu cograph without universal vertices, then

μ(G)=μt(G).\mu(G)=\mu_{\rm t}(G).

This conjecture seeks to characterize the distance-hereditary graphs for which the mutual-visibility number exceeds the total mutual-visibility number, extending the established classification for cographs. The supplied text gives no resolution status beyond the conjectural formulation.

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.