The Sands–Sauer–Woodrow conjecture for 3-coloured tournaments
Statement
Let be a finite 3-coloured tournament, meaning a tournament whose edges are coloured with at most three colours. A tournament is a if three of its vertices span a non-transitive tournament whose three edges have distinct colours. Sands–Sauer–Woodrow conjecture. has either a triple of vertices that span a or a single vertex that dominates every other vertex monochromatically, meaning that for every other vertex there is a directed path from the chosen vertex to all of whose edges have the same colour. This conjecture is the 3-colour case of a problem posed by Sands, Sauer, and Woodrow and attributed by them to Erdős; the supplied text does not establish whether it is open or resolved.
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.