Claws contained in all \(n\)-tournaments (Q688260): Difference between revisions

A claw in a directed graph is a subdigraph consisting of directed paths which are vertex-disjoint other than sharing a common initial vertex called the root. The degree of a claw is the outdegree of the root. The author proves that any claw of degree \(d \leq 2n/8\) is a subdigraph of every tournament with \(n\) vertices. This improves an earlier result by the same author with \(d \leq n/4\) replacing \(d \leq 3n/8\), see [On claws belonging to every tournament, Combinatorica 11, No. 2, 173-179 (1991; Zbl 0749.05036)].