On monochromatic paths in m-coloured tournaments
type: Item
instance of: scholarly article
title: On monochromatic paths in m-coloured tournaments
zbMATH Open document ID: 0654.05033
DOI: 10.1016/0095-8956(88)90059-7
author: Shen Minggang
published in: Journal of Combinatorial Theory. Series B
publication date: 1988-01-01T00:00:00Z
review text: Suppose the arcs of a tournament \(T_ n\) are coloured with m colours in such a way that no subtournament \(T_ 3\) has its arcs coloured with 3 distinct colours. The author shows that such a tournament \(T_ n\) must contain a vertex u that can be reached by a monochromatic path from every other vertex v.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4066924
zbMATH Keywords: arc colouring
zbMATH Keywords: tournament
zbMATH Keywords: monochromatic path
reviewed by: J. W. Moon
MaRDI profile type: Publication
full work available at URL: 0095-8956(88)90059-7
OpenAlex ID: W2045621845
cites work: On monochromatic paths in edge-coloured digraphs
cites work: Q3220616
description: scientific article; zbMATH DE number 4066924