On 3-coloured tournaments - Mathematics > CombinatoricsReport as inadecuate




On 3-coloured tournaments - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: We re-prove that in every 3-edge-coloured tournament in which no vertex isincident with all colours there is either a cyclic rainbow triangle or a vertexdominating every other vertex monochromatically.



Author: Agelos Georgakopoulos, Philipp Sprüssel

Source: https://arxiv.org/







Related documents