Keywords
- Automorphism Group
- Permutation Group
- Wreath Product
- Colour Scheme
- Primitive Group
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Barwise (ed.), Handbook of Mathematical Logic (North-Holland, Amsterdam, 1977).
L.W. Beineke and R.J. Wilson (eds.), Selected Topics in Graph Theory (Academic Press, London, 1980).
B.J. Birch, R.G. Burns, S.O. Macdonald and P.M. Neumann, On the orbit-sizes of permutation groups containing elements separating finite subsets, Bull. Austral. Math. Soc. 14 (1976), 7–10.
M. Brown, Weak n-homogeneity implies weak (n-1)-homogeneity, Proc. Amer. Math. Soc. 10 (1959), 644–647.
P.J. Cameron, Transitivity of permutation groups on unordered sets, Math. Z. 148 (1976), 127–139.
P.J. Cameron, Orbits of permutation groups on unordered sets, I, J. London Math. Soc. (2) 17 (1978), 410–414; II, ibid. (2) 23 (1981), 249–264.
P.J. Cameron, Colour schemes, to appear in Discrete Math.
P.J. Cameron and J. Saxl, Permuting unordered subsets, submitted.
R. Fraissé, Sur certains relations qui généralisent l'ordre des nombres rationnels, C.R. Acad. Sci. Paris 237 (1953), 540–542.
M. Hall Jr., Combinatorial Theory (Blaisdell, Waltham, 1967).
P. Hall, Some constructions for locally finite groups, J. London Math. Soc. 34 (1959), 305–319.
C.W. Henson, Countable homogeneous relational structures and ℵO-categorical theories, J. Symbolic Logic, 37 (1972), 494–500.
D.G. Higman, Intersection matrices for finite permutation groups, J. Algebra 6 (1967), 22–42.
G. Higman, Homogeneous relations, Quart. J. Math. Oxford (2) 28 (1977), 31–39.
W.A. Hodges, A.H. Lachlan and S. Shelah, Possible orderings of an indiscernible sequence, Bull. London Math. Soc. 9 (1979), 212–215.
W.M. Kantor, On incidence matrices of finite projective and affine spaces, Math. Z. 124 (1972), 315–318.
O.H. Kegel, Examples of highly transitive permutation groups, Rend. Sem. Mat. Univ. Padova 63 (1980), 295–300.
A.H. Lachlan and R.E. Woodrow, Countable ultrahomogeneous undirected graphs, Trans. Amer. Math. Soc. 262 (1980), 51–94.
D. Livingstone and A. Wagner, Transitivity of finite permutation groups on unordered sets, Math. Z. 90 (1965), 393–403.
T.P. McDonough, On a permutation representation of a free group, Quart. J. Math. Oxford (2) 28 (1977), 353–356.
H.D. Macpherson, Dissertation, Oxford 1981. (A paper is being prepared for publication.)
C.L. Mallows and N.J.A. Sloane, Two-graphs, switching classes, and Euler graphs are equal in number, SIAM J. Appl. Math. 28 (1975), 876–880.
J. Schmerl, Countable homogeneous partially ordered sets, Algebra Universalis 9 (1979), 317–321.
W. Sierpinski, Sur une propriété topologique des ensembles dénombrables denses en soi, Fund. Math. 1 (1920), 11–16.
J. Tits, Buildings of Spherical Type and Finite BN-Pairs (Lecture Notes in Math. 386, Springer-Verlag, Berlin, 1974).
R.E. Woodrow, There are four countable ultrahomogeneous graphs without triangles, J. Combinatorial Theory (B) 27 (1979), 168–179.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag
About this paper
Cite this paper
Cameron, P.J. (1982). Orbits, enumeration and colouring. In: Billington, E.J., Oates-Williams, S., Street, A.P. (eds) Combinatorial Mathematics IX. Lecture Notes in Mathematics, vol 952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0061972
Download citation
DOI: https://doi.org/10.1007/BFb0061972
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11601-1
Online ISBN: 978-3-540-39375-7
eBook Packages: Springer Book Archive
