Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-27T06:21:03.726Z Has data issue: false hasContentIssue false
  • English
  • Français

The Maximum Order of the Group of a Tournament

Published online by Cambridge University Press:  20 November 2018

John D. Dixon
John D. Dixon*
Affiliation:
University of New South Wales, Australia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

To each tournament Tn with n nodes n there corresponds the automorphism group G(Tn) consisting n of all dominance preserving permutations of the set of nodes. In a recent paper [3], Myron Goldberg and J. W. Moon consider the maximum order g(n) which the group of a tournament with n nodes may have. Among other results they prove that

1

2

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 10 , Issue 4 , October 1967 , pp. 503 - 505
Copyright
Copyright © Canadian Mathematical Society 1967

References

1. Dixon, J. D., The Fitting subgroup of a linear solvable group, J. Austral. Math. Soc. 7 (1966), to appear.Google Scholar
2. Feit, W. and Thompson, J. G., Solvability of groups of odd order. Pac. J. Math. 13 (1966), 775-1029.Google Scholar
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