ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a finite 3-coloured tournament, meaning a tournament whose edges are coloured with at most three colours. A tournament is a T3T_3 if three of its vertices span a non-transitive tournament whose three edges have distinct colours. Sands–Sauer–Woodrow conjecture. TT has either a triple of vertices that span a T3T_3 or a single vertex that dominates every other vertex monochromatically, meaning that for every other vertex yy there is a directed path from the chosen vertex to yy 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 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.