The Maximum Order of the Group of a Tournament
Canadian mathematical bulletin, Tome 10 (1967) no. 4, pp. 503-505
Voir la notice de l'article provenant de la source Cambridge University Press
To each tournament Tn with n nodes n there corresponds theautomorphism group G(Tn) consisting n of all dominance preservingpermutations of the set of nodes. In a recent paper [3], Myron Goldberg andJ. W. Moon consider the maximum order g(n) which the group of a tournamentwith n nodes may have. Among other results they prove that 1 2
Dixon, John D. The Maximum Order of the Group of a Tournament. Canadian mathematical bulletin, Tome 10 (1967) no. 4, pp. 503-505. doi: 10.4153/CMB-1967-048-9
@article{10_4153_CMB_1967_048_9,
author = {Dixon, John D.},
title = {The {Maximum} {Order} of the {Group} of a {Tournament}},
journal = {Canadian mathematical bulletin},
pages = {503--505},
year = {1967},
volume = {10},
number = {4},
doi = {10.4153/CMB-1967-048-9},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1967-048-9/}
}
[1] 1. Dixon, J. D., The Fitting subgroup of a linear solvable group, J. Austral. Math. Soc. 7 (1966), to appear. Google Scholar
[2] 2. Feit, W. and Thompson, J. G., Solvability of groups of odd order. Pac. J. Math. 13 (1966), 775-1029. Google Scholar
[3] 3. Goldberg, M. and Moon, J. W., On the maximum order of the group of a tournament. Canad. Math. Bull. 9 (1966), 563-569. Google Scholar
Cité par Sources :