Tight paths in fully directed hypergraphs

Richard C. Devine, Kevin G. Milans

It is well-known that every tournament has a spanning path. We consider hypergraph analogues. In an \emph{$r$-uniform fully directed hypergraph}, or \emph{$r$-digraph}, every edge…