Finite obstruction conjecture for semiacyclic tournaments
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.