Some unavoidable subdigraphs of tournaments
Vojislav Petrović · Journal of Graph Theory · 1988
Abstract Let H(n, i) be a simple (n − 1)‐path v1 → v2 → …︁ → vn with an additional arc v1vi (3 ⩽ i ⩽ n). We prove that for each n and i (3 ⩽ i ⩽ n), with few exceptions, every n‐tournament Tn contains a copy of H(n, i).