zbMATH — the first resource for mathematics

On monochromatic paths in m-coloured tournaments. (English) Zbl 0654.05033
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.
Reviewer: J.W.Moon

05C15 Coloring of graphs and hypergraphs
05C20 Directed graphs (digraphs), tournaments
05C38 Paths and cycles
Full Text: DOI
[1] Sands, B; Sauer, N; Woodrow, R, On monochromatic paths in edge-coloured digraphs, J. combin. theory ser. B, 33, 271-275, (1982) · Zbl 0488.05036
[2] Reid, K.B, Monochromatic reachability, complementary cycles, and single arc reversals in tournaments, (), 11-21 · Zbl 0556.05031
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.