Cycles of Each Length in Regular Tournaments
Canadian mathematical bulletin, Tome 10 (1967) no. 2, pp. 283-286
Voir la notice de l'article provenant de la source Cambridge
It is known that a strong tournament of order n contains a cycle of each length k, k=3,..., n, ([l], Thm. 7). Moon [2] observed that each vertex in a strong tournament of order n is contained in a cycle of each length k, k = 3,..., n. In this paper we obtain a similar result for each arc of a regular tournament, that is, a tournament in which all vertices have the same score.
Alspach, Brian. Cycles of Each Length in Regular Tournaments. Canadian mathematical bulletin, Tome 10 (1967) no. 2, pp. 283-286. doi: 10.4153/CMB-1967-028-6
@article{10_4153_CMB_1967_028_6,
author = {Alspach, Brian},
title = {Cycles of {Each} {Length} in {Regular} {Tournaments}},
journal = {Canadian mathematical bulletin},
pages = {283--286},
year = {1967},
volume = {10},
number = {2},
doi = {10.4153/CMB-1967-028-6},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1967-028-6/}
}
Cité par Sources :