Hostname: page-component-848d4c4894-4hhp2 Total loading time: 0 Render date: 2024-06-12T21:59:19.489Z Has data issue: false hasContentIssue false
  • English
  • Français

Cycle-types in the automorphism groups of countable homogeneous graphs

Published online by Cambridge University Press:  07 April 2011

S. LOVELL  and
J. K. TRUSS
S. LOVELL
Affiliation:
Department of Pure Mathematics, University of Leeds, Leeds LS29JT. e-mail: pmtjkt@leeds.ac.uk
J. K. TRUSS
Affiliation:
Department of Pure Mathematics, University of Leeds, Leeds LS29JT. e-mail: pmtjkt@leeds.ac.uk
Get access Rights & Permissions [Opens in a new window]

Abstract

We give a classification of all the cycle types occurring in the automorphism groups of countable homogeneous graphs.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 151 , Issue 1 , July 2011 , pp. 23 - 41
Copyright
Copyright © Cambridge Philosophical Society 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Cameron, P. J. Oligomorphic permutation groups. London Math. Soc. Lecture Note Ser. 152, Cambridge University Press, (1990).Google Scholar
[2]Ward Henson, C.A family of countable homogeneous graphs. Pacific J. Math. 38 (1971), 69–83.CrossRefGoogle Scholar
[3]Lachlan, A. H. and Woodrow, R.Countable ultrahomogeneous undirected graphs. Trans. Amer. Math. Soc. 262 (1980), 51–94.CrossRefGoogle Scholar
[4]Lachlan, A. H.Countable homogeneous tournaments. Trans. Amer. Mtah. Soc. 284 (1984), 431–461.CrossRefGoogle Scholar
[5]Macpherson, D. and Praeger, C. E.Cycle types in infinite permutation groups. J. Algebra 175 (1995), 212–240.CrossRefGoogle Scholar
[6]Truss, J. K.The group of the countable universal graph. Math. Proc. Camb. Philo. Soc. 98 (1985), 213–245.CrossRefGoogle Scholar