Out-arc pancyclicity of vertices in tournaments

Abstract: Yao, Guo and Zhang [T. Yao, Y. Guo, K. Zhang, Pancyclic out-arcs of a vertex in a tournament, Discrete Appl. Math. 99 (2000) 245–249.] proved that every strong tournament contains a vertex such that every out-arc of is pancyclic. In this paper, we prove that every strong tournament with minimum out-degree at least two contains two such vertices. Yeo [A. Yeo, The number of pancyclic arcs in a -strong tournament, J. Graph Theory 50 (2005) 212–219.] conjectured that every 2-strong tournament has three distinct vertices , such that every arc out of and is pancyclic. In this paper, we also prove that Yeo’s conjecture is true. [Copyright &y& Elsevier]