On monochromatic paths in m-coloured tournaments (Q1108286)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1108286 |
scientific article; zbMATH DE number 4066924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On monochromatic paths in m-coloured tournaments |
scientific article; zbMATH DE number 4066924 |
Statements
On monochromatic paths in m-coloured tournaments (English)
0 references
1988
0 references
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.
0 references
arc colouring
0 references
tournament
0 references
monochromatic path
0 references
0.935388445854187
0 references
0.902779221534729
0 references
0.8632418513298035
0 references
0.8611833453178406
0 references
