On 3-coloured tournaments - Mathematics > CombinatoricsReportar como inadecuado




On 3-coloured tournaments - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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.



Autor: Agelos Georgakopoulos, Philipp Sprüssel

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados