Papers › Path-monochromatic bounded depth rooted trees in (random) tournaments
Path-monochromatic bounded depth rooted trees in (random) tournaments
Raphael Yuster
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
An edge-colored rooted directed tree (aka arborescence) is path-monochromatic if every path in it is monochromatic. Let k,ℓ be positive integers. For a tournament T, let f_T(k) be the largest integer such that every k-edge coloring of T has a path-monochromatic subtree with at least f_T(k) vertices and let f_T(k,ℓ) be the restriction to subtrees of depth at most ℓ. It was proved by Landau that f_T(1,2)=n and proved by Sands et al. that f_T(2)=n where |V(T)|=n. Here we consider f_T(k) and f_T(k,ℓ) in more generality, determine their extremal values in most cases, and in fact in all cases assuming the Caccetta-H\"aggkvist Conjecture. We also study the typical value of f_T(k) and f_T(k,ℓ), i.e., when T is a random tournament.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections