Skip to main content
SpringerLink
Log in

Overgroups of the Automorphism Group of the Rado Graph

  • Chapter
  • First Online:
Asymptotic Geometric Analysis

Part of the book series: Fields Institute Communications ((FIC,volume 68))

  • 1284 Accesses

Abstract

We are interested in overgroups of the automorphism group of the Rado graph. One class of such overgroups is completely understood; this is the class of reducts. In this article we tie recent work on various other natural overgroups, in particular establishing group connections between them and the reducts.

Mathematical Subject Classifications (2010): 05C25, 05C80, 05C55, 05C63, 20F28

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. M. Bodirsky, M. Pinsker, Minimal functions on the random graph. Preprint (2010). arXiv:1003.4030

    Google Scholar 

  2. P.J. Cameron, S. Tarzi, Filters, Topologies and Groups from the Random Graph. Manuscript (2007)

    Google Scholar 

  3. R. Diestel, Graph theory, in Graduate Texts in Mathematics, vol. 173 (Springer, Heidelberg, 2005)

    Google Scholar 

  4. C. Laflamme, M. Pouzet, N. Sauer, The hypergraph of copies of the rado graph, in preparation

    Google Scholar 

  5. S.R. Thomas, Reducts of the random graph. J. Symbolic Logic 56, 176–181 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. S.R. Thomas, Reducts of Random Hypergraphs. Ann. Pure Appl. Logic 80, 165–183 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

Claude Laflamme’s work was supported by NSERC of Canada Grant # 690404.

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London, E1 4NS, UK

    Peter Cameron & Sam Tarzi

  2. Department of Mathematics and Statistics, University of Calgary, 2500 University Dr., NW, Calgary, Alberta, Canada, T2N 1N4

    Claude Laflamme & Robert Woodrow

  3. ICJ, Mathematiques, 43 Bd. 11 Novembre 1918, 69622, Villeurbanne cedex, France

    Maurice Pouzet

Authors
  1. Peter Cameron
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claude Laflamme
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maurice Pouzet
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sam Tarzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Robert Woodrow
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Claude Laflamme .

Editor information

Editors and Affiliations

  1. TU Wien, Wiedner Hauptstrasse 8–10, Wien, 1040, Austria

    Monika Ludwig

  2. Fac. Exact Sciences, School of Mathematical Sciences, University of Tel Aviv, Schreiber Building 334, Tel Aviv, 69978, Israel

    Vitali D. Milman

  3. University of Ottawa, Ottawa, K1N 6N5, Canada

    Vladimir Pestov

  4. , Department of Math and Stat Scis, University of Alberta, Central Academic Bldg 632, Edmonton, T6G 2G1, Alberta, Canada

    Nicole Tomczak-Jaegermann

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Cameron, P., Laflamme, C., Pouzet, M., Tarzi, S., Woodrow, R. (2013). Overgroups of the Automorphism Group of the Rado Graph. In: Ludwig, M., Milman, V., Pestov, V., Tomczak-Jaegermann, N. (eds) Asymptotic Geometric Analysis. Fields Institute Communications, vol 68. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6406-8_4

Download citation

Publish with us

Policies and ethics

Search

Navigation