Journal article icon

Journal article

Flashes and rainbows in tournaments

Abstract:

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ödl, and Thomasconjectured in1992that f (l,k) = lk−1 and proved this for l ě (3k)2k. We prove the conjecture for l ě k3(logk)1+o(1) and establish the general upper bound f (l,k) ď k(logk)1+o(1) &middo...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1007/s00493-024-00090-7

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
Merton College
Role:
Author
ORCID:
0000-0003-4489-5988
Publisher:
Springer
Journal:
Combinatorica More from this journal
Volume:
44
Issue:
3
Pages:
675-690
Publication date:
2024-04-04
Acceptance date:
2024-02-01
DOI:
EISSN:
1439-6912
ISSN:
0209-9683
Language:
English
Keywords:
Pubs id:
1611172
Local pid:
pubs:1611172
Deposit date:
2024-02-01

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP