Answers are grounded in this paper and cite their sources.
It is well-known that every tournament has a spanning path. We consider hypergraph analogues. In an r-uniform fully directed hypergraph , or r-digraph , every edge is a list of r distinct vertices. An ( r , k ) -tournament is an r -digraph G such that for every r -set S of vertices in G , exactly k of the orderings of S are edges in G . A directed tight path is an r -digraph G whose vertices can be ordered so that the intervals of size r are the edges in G . Let f ( n , r , k ) be the maximum s such that every n -vertex ( r , k ) -tournament contains a tight path on s vertices. Since every tournament has a spanning path, we have f ( n , 2 , 1 ) = n . In this paper, we show that the minimum k such that f ( n , r , k ) tends to infinity with n is in the interval [ ( 1 − 1 r − O ( log r r 2 log log r ) ) r ! , ( 1 − 1 r − φ ( r ) − 1 r ! ) r ! ] where φ ( r ) is the Euler Totient Function, and we find the exact value when r ≤ 5 . We also show that Ω ( log n / log log n ) ≤ f ( n , 3 , 3 ) ≤ O ( log n ) and f ( n , 3 , 4 ) ≥ Ω ( n 1 / 5 ) .
No takes yet. Share an insight, caveat, or question.
Devine et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: