# THE NUMBER OF PANCYCLIC ARCS CONTAINED IN A HAMILTONIAN CYCLE OF A TOURNAMENT

• Surmacs, Michel
• Received : 2013.08.29
• Published : 2014.11.30
• 59 4

#### Abstract

A tournament T is an orientation of a complete graph and an arc in T is called pancyclic if it is contained in a cycle of length l for all $3{\leq}l{\leq}n$, where n is the cardinality of the vertex set of T. In 1994, Moon [5] introduced the graph parameter h(T) as the maximum number of pancyclic arcs contained in the same Hamiltonian cycle of T and showed that $h(T){\geq}3$ for all strong tournaments with $n{\geq}3$. Havet [4] later conjectured that $h(T){\geq}2k+1$ for all k-strong tournaments and proved the case k = 2. In 2005, Yeo [7] gave the lower bound $h(T){\geq}\frac{k+5}{2}$ for all k-strong tournaments T. In this note, we will improve his bound to $h(T){\geq}\frac{2k+7}{3}$.

#### Keywords

tournament;pancyclic arc;Hamiltonian cycle

#### References

1. C. Thomassen, Hamiltonian-connected tournaments, J. Combin. Theory Ser. B 28 (1980), no. 2, 142-163. https://doi.org/10.1016/0095-8956(80)90061-1
2. J. Bang-Jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications, Springer, London, 2000.
3. P. Camion, Chemins et circuits hamiltoniens des graphes complets, C. R. Acad. Sci. Paris 249 (1959), 2151-2152.
4. J. Feng, Hamiltonian Cycles in Certain Graphs and Out-arc Pancyclic Vertices in Tournaments, Ph.D. thesis, 67-68, RWTH Aachen, 2008.
5. F. Havet, Pancyclic arcs and connectivity in tournaments, J. Graph Theory 47 (2004), no. 2, 87-110. https://doi.org/10.1002/jgt.20018
6. J. W. Moon, On k-cyclic and pancyclic arcs in strong tournaments, J. Combin. Inform. System Sci. 19 (1994), no. 3-4, 207-214.
7. A. Yeo, The number of pancyclic arcs in a k-strong tournament, J. Graph Theory 50 (2005), no. 3, 212-219. https://doi.org/10.1002/jgt.20110