Flashes and rainbows in tournaments
<p>Colour the edges of the complete graph with vertex set {1,2,...,n} with an arbitrary number of colours. What is the smallest integer f (l,k) such that if n > f (l,k) then there must exist a monotone monochromatic path of length l or a monotone rainbow path of length k? Lefmann, R&...
| Үндсэн зохиолчид: | , , , , |
|---|---|
| Формат: | Journal article |
| Хэл сонгох: | English |
| Хэвлэсэн: |
Springer
2024
|