On 3-coloured tournaments

Simple item page
dc.creatorGeorgakopoulos, Agelos
dc.creatorSprüssel, Philipp
dc.date2009-04-13
dc.date2009-04-17
dc.date.accessioned2026-07-07T13:04:55Z
dc.date.available2026-07-07T13:04:55Z
dc.descriptionWe (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.
dc.descriptionWe found out that our main result had appeared before (in [3]), and updated the paper to add this information
dc.identifierhttps://arxiv.org/abs/0904.1967
dc.identifierhttp://arxiv.org/abs/0904.1967
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227339
dc.subjectCombinatorics
dc.subject05C20
dc.titleOn 3-coloured tournaments
dc.typetext

Files

Collections

arXiv