On monochromatic paths in m-coloured tournaments (Q1108286): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: John W. Moon / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: John W. Moon / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(88)90059-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045621845 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On monochromatic paths in edge-coloured digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3220616 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:50, 18 June 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
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
