ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree of maximum degree Δ\Delta. For d≥Δd\geq\Delta, let Td‾\overline{T_d} be a dd-regular graph obtained from TT by adding semi-edges or loops so that every vertex of Td‾\overline{T_d} has degree dd; this graph is not uniquely determined. Regular-tree completion conjecture. If Δ≥3\Delta\geq 3 and Td‾\overline{T_d} is constructed as above, then the \textscTd‾−Cover\textsc{\overline{T_d}-Cover} problem is NP-complete even for simple input graphs. This is proposed as an open question arising from the paper's results, and its proof is described as a further goal.

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.