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
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/}
}
Cité par Sources :