Hostname: page-component-8448b6f56d-qsmjn Total loading time: 0 Render date: 2024-04-18T12:38:41.242Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Determination of the Maximum Order of the Group of a Tournament

Published online by Cambridge University Press:  20 November 2018

B. Alspach  and
J. L. Berggren
B. Alspach
Affiliation:
Simon Fraser University, Burnaby British Columbia
J. L. Berggren
Affiliation:
Simon Fraser University, Burnaby British Columbia
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.

Let denote the automorphism group of the tournament T. Let g(n) be the maximum of taken over all tournaments of order n. It was noted in [3] that g(n) is also the order of the subgroups of Sn of maximum odd order where Sn denotes the symmetric group of degree n.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 16 , Issue 1 , March 1973 , pp. 11 - 14
Copyright
Copyright © Canadian Mathematical Society 1973

References

1. Alspach, Brian, A combinatorial proof of a conjecture of Goldberg and Moon, Canad. Math. Bull. 11 (1968), 655–661.Google Scholar
2. Dixon, John D., The maximum order of the group of a tournament, Canad. Math. Bull. 10 (1967), 503–505.Google Scholar
3. Goldberg, Myron and Moon, J. W., On the maximum order of the group of a tournament, Canad. Math. Bull. 9 (1966), 563–569.Google Scholar
4. Huppert, B., Endliche Gruppen I Springer-Verlag, Berlin, 1967.Google Scholar
5. Moon, J. W., Tournaments with a given automorphism group, Canad. J. Math. 16 (1964), 485–489.Google Scholar
6. Moon, J. W., Topics on tournaments Holt, Toronto, 1968.Google Scholar