ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P9P_9 denote the path on 99 vertices, let C9C_9 denote the cycle on 99 vertices, and let HH be the graph shown in Figure H. A graph is (P9,C9,H)(P_9,C_9,H)-free if it contains none of these graphs as an induced subgraph. For a graph GG, let γ(G)\gamma(G) be its domination number and γc(G)\gamma_c(G) its connected domination number. Connected domination conjecture. For every connected (P9,C9,H)(P_9,C_9,H)-free graph GG,

γc(G)≤2γ(G).\gamma_c(G) \le 2\gamma(G).

This extends the established bound for connected (P8,C8)(P_8,C_8)-free graphs; the conjecture concerns whether the same factor-two bound remains valid in the larger class obtained by forbidding P9P_9, C9C_9, and the graph HH.

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.