On 3-coloured tournaments
Combinatorics
2009-04-17 v2
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.
Keywords
Cite
@article{arxiv.0904.1967,
title = {On 3-coloured tournaments},
author = {Agelos Georgakopoulos and Philipp Sprüssel},
journal= {arXiv preprint arXiv:0904.1967},
year = {2009}
}
Comments
We found out that our main result had appeared before (in [3]), and updated the paper to add this information