ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H′H' be a graph, and let HH be a block graph of H′H', meaning a graph obtained from H′H' by replacing each block according to the block construction used in the paper. The problem \scH-Cover{\sc H\text{-}Cover} asks whether a simple input graph admits a cover mapping to HH.

Block reduction conjecture. The problem \scH-Cover{\sc H\text{-}Cover} for simple input graphs polynomially reduces to \scH′-Cover{\sc H'\text{-}Cover} for simple input graphs.

The conjecture is proposed as a possible extension of the paper's reduction method and could help transfer complexity results between target graphs. The supplied context does not establish whether it has been proved or refuted.

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.