ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk and rr be positive integers. The problem \textsc{kthk^{th}Power of a Graph With Girth rr} asks, given a graph GG, whether there exists a graph HH of girth rr such that G=HkG=H^k. Higher-power girth conjecture. The problem \textsc{kthk^{th}Power of a Graph With Girth rr} for r=2k+1r=2k+1 is NP-complete. The conjecture proposes the missing NP-complete case in a complete girth-parametrized complexity dichotomy for higher graph-root finding; related results establish NP-completeness when r=kr=k and a polynomial-time algorithm for finding all kthk^{th} roots of girth 2k+32k+3.

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.