On heterochromatic out-directed spanning trees in tournaments (Q5964994): Difference between revisions

A tournament is a digraph \(D\) such that for every pair of vertices \(x\) and \(y\), the arc \((x, y)\) or \((y, x)\) is in \(D\), but not both. The purpose of the paper is to determine the smallest integer \(k\) such that every arc-coloring of a tournament \(T\) with \(k\) or more colors produces at least one out-directed spanning tree \(t\) of \(T\) with no pair of arcs with the same color, where \(t\) is a tree with root vertex \(r\) such that for each vertex \(u\), the unique path between \(u\) and \(r\) of \(t\) is directed from \(r\) to \(u\).