ProbXiv
Explorersign in
Problem archiveProblem record

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 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.