Block reduction conjecture for graph covers
Statement
Let be a graph, and let be a block graph of , meaning a graph obtained from by replacing each block according to the block construction used in the paper. The problem asks whether a simple input graph admits a cover mapping to .
Block reduction conjecture. The problem for simple input graphs polynomially reduces to 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.