zbMATH — the first resource for mathematics

The number of pancyclic arcs in a \(k\)-strong tournament. (English) Zbl 1081.05041
An arc in a tournament \(T\) is pancyclic if it lies in directed cycles of all possible lengths, that is, length 3 through length the order of \(T\). The author obtains significant improvements on bounds for the number of pancyclic arcs in a \(k\)-strong tournament, and the maximum number of pancyclic arcs in a single Hamilton directed cycle of a \(k\)-strong tournament.

05C20 Directed graphs (digraphs), tournaments
05C38 Paths and cycles
Full Text: DOI
[1] Alspach, Canad Math Bull 10 pp 283– (1967) · Zbl 0148.43602 · doi:10.4153/CMB-1967-028-6
[2] and , Digraphs: Theory, Algorithms and Applications, Springer, London, 2000.
[3] Camion, C R Acad Sci Paris 249 pp 2151– (1959)
[4] Havet, J Graph Theory 47 pp 87– (2004)
[5] Topics on Tournaments, Holt, Rinehart and Winston, New York, 1968.
[6] Thomassen, J Combin Theory Ser B 28 pp 142– (1980)
[7] Yao, Discrete Appl Math 99 pp 245– (2000)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.