On 3-coloured tournaments
classification
🧮 math.CO
keywords
vertexeverycolouredcolourscyclicdominatingedge-colouredeither
read the original abstract
We (re-)prove that in every 3-edge-coloured tournament in which no vertex is incident with all colours there is either a cyclic rainbow triangle or a vertex dominating every other vertex monochromatically.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.