The 2-DIOMEGA-ORDERING NP-completeness conjecture
Statement
Let be a tournament, and let denote the minimum, over all orderings of , of the clique number of the corresponding backedge graph. The 2-DIOMEGA-ORDERING conjecture. The problem of deciding whether is NP-complete. The cases and are respectively polynomial and NP-complete; the source presents the case 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.