No CrossRef data available.
Article contents
Cycle-types in the automorphism groups of countable homogeneous graphs
Published online by Cambridge University Press: 07 April 2011
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
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