ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tournament, and let ω→⁡(T)\operatorname{\overrightarrow{\omega}}(T) denote the minimum, over all orderings of V(T)V(T), of the clique number of the corresponding backedge graph. The 2-DIOMEGA-ORDERING conjecture. The problem of deciding whether ω→⁡(T)≤2\operatorname{\overrightarrow{\omega}}(T)\leq 2 is NP-complete. The cases k=1k=1 and k≥3k\geq 3 are respectively polynomial and NP-complete; the source presents the case k=2k=2 as the remaining question, but does not provide a 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.