MathNet 2026 — Part 09 Question 149

Let $f(n)$ be the minimal number of colors needed to properly color the directed edges of a tournament on $n$ vertices so that no two edges of the same color form a directed path of length $2$. Determine $f(n)$ for all $n \ge 1$.