ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A cubic graph is a graph in which every vertex has degree 33. The decision problem INDUCED CYCLE asks whether a graph has an induced cycle of the specified type considered in the paper.

Cubic induced-cycle NP-completeness conjecture. INDUCED CYCLE is NP-complete for cubic graphs.

The paper proves NP-completeness for graphs of maximum degree 44 but conjectures the stronger result for cubic graphs; the source gives no resolution.

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.