Skip to main content

Orbits and enumeration

  • Conference paper
  • First Online:
Combinatorial Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 969))

  • 411 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Barwise,(ed.) Handbook of Mathematical Logic, North-Holland, Amsterdam-New York-Oxford, (1977).

    Google Scholar 

  2. 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–265; III, IV, ibid., to appear.

    Article  MathSciNet  MATH  Google Scholar 

  3. P.J.Cameron, Colour schemes, Annals Discr.Math., in press.

    Google Scholar 

  4. P.J.Cameron, Orbits, enumeration and colouring, Proc. 9th Australian Conf.Combinatorial Mathematics, (ed.A.P.Street), Lecture Notes in Math., Springer-Verlag, in press.

    Google Scholar 

  5. P.J.Cameron and J.Saxl, Permuting unordered subsets, Quart. J. Math. Oxford, to appear.

    Google Scholar 

  6. P. Erdös and J. Spencer, Probabilistic Methods in Combinatorics, Academic Press, New York, (1974).

    MATH  Google Scholar 

  7. A.M.W. Glass, Ordered Permutation Groups, London Math.Soc.Lecture Notes 55, Cambridge Univ.Press, Cambridge, (1981).

    MATH  Google Scholar 

  8. F. Harary and E.M. Palmer, Graphical Enumeration, Academic Press, New York-London (1973).

    MATH  Google Scholar 

  9. H.D.Macpherson, The action of an infinite permutation group on the unordered subsets of a set, J.London Math.Soc., to appear.

    Google Scholar 

  10. M.Pouzet, Caractérisation topologique et combinatoire des âges les plus simples, preprint.

    Google Scholar 

  11. N.J.A. Sloane, Handbook of Integer Sequences, Academic Press, New York-San Francisco-London (1973).

    MATH  Google Scholar 

  12. R.E. Woodrow, There are four countable ultrahomogeneous graphs without triangles, J.Combinatorial Theory (B), 27 (1979), 168–179.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dieter Jungnickel Klaus Vedder

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag

About this paper

Cite this paper

Cameron, P.J. (1982). Orbits and enumeration. In: Jungnickel, D., Vedder, K. (eds) Combinatorial Theory. Lecture Notes in Mathematics, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062988

Download citation

  • DOI: https://doi.org/10.1007/BFb0062988

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11971-5

  • Online ISBN: 978-3-540-39380-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics