ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. It is 2-divisible if, for every induced subgraph HH of GG, the vertex set V(H)V(H) can be partitioned into sets AA and BB such that

ω(A)<ω(H)andω(B)<ω(H).\omega(A)<\omega(H)\quad\text{and}\quad\omega(B)<\omega(H).

The NP-completeness conjecture. It is NP-complete to determine whether a graph is 2-divisible.

The conjecture concerns the computational complexity of recognizing 2-divisible graphs; no resolution is given in the source.

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.