ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A tournament is a complete oriented graph, and a tournament is semiacyclic if it admits a numbering of its vertices with no directed cycle having positive winding number. A tournament is minimally not semiacyclic if it is not semiacyclic, but deleting any vertex leaves a tournament whose vertices can be numbered so that it is semiacyclic.

Finite obstruction conjecture. There is a finite list of tournaments that are minimally not semiacyclic.

This asks for a finite obstruction set when the vertex numbering may be chosen freely, in contrast with the obstruction list for a fixed numbering given by Postnikov and Stanley. The source provides no resolution, so the conjecture remains open.

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.