On 3-coloured tournaments
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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.
We found out that our main result had appeared before (in [3]), and updated the paper to add this information
We found out that our main result had appeared before (in [3]), and updated the paper to add this information