On the longest monochromatic paths in edge-colored tournaments (Q2748945)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1663564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the longest monochromatic paths in edge-colored tournaments |
scientific article; zbMATH DE number 1663564 |
Statements
22 July 2002
0 references
longest paths
0 references
tournament
0 references
monochromatic path
0 references
On the longest monochromatic paths in edge-colored tournaments (English)
0 references
Let \(T\) denote a tournament with at least \(2k(k+1)/3+2\) nodes each of whose edges is coloured either red or blue. The author shows that such a tournament contains a monochromatic path of length \(k\).
0 references
0.8672795295715332
0 references
0.8611833453178406
0 references
0.8459563851356506
0 references
