NP-completeness of higher graph powers of girth 2k+1
Statement
Let and be positive integers. The problem \textsc{Power of a Graph With Girth } asks, given a graph , whether there exists a graph of girth such that . Higher-power girth conjecture. The problem \textsc{Power of a Graph With Girth } for 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 and a polynomial-time algorithm for finding all roots of girth .
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.