The NP-completeness conjecture for detecting odd holes
Statement
An odd hole is an induced cycle of odd length at least five.
The odd-hole detection conjecture. It is NP-complete to determine whether a graph contains an odd hole.
This conjecture concerns the complexity of odd-hole detection. The source notes that the complexity of recognizing odd-hole-free graphs is unknown, and gives no resolution of this conjecture.
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.