On monochromatic paths in m-coloured tournaments (Q1108286): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 02:08, 31 January 2024

scientific article
Language Label Description Also known as
English
On monochromatic paths in m-coloured tournaments
scientific article

    Statements

    On monochromatic paths in m-coloured tournaments (English)
    0 references
    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
    0 references
    arc colouring
    0 references
    tournament
    0 references
    monochromatic path
    0 references

    Identifiers