Skip to main content
SpringerLink
Log in

Symmetrized Induced Ramsey Theory

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We prove induced Ramsey theorems in which the monochromatic induced subgraph satisfies that all members of a prescribed set of its partial isomorphisms extend to automorphisms of the colored graph (without requirement of preservation of colors). We consider vertex and edge colorings, and extensions of partial isomorphisms in the set of all partial isomorphisms between singletons as considered by Babai and Sós (European J Combin 6(2):101–114, 1985), the set of all finite partial isomorphisms as considered by Hrushovski (Combinatorica 12(4):411–416, 1992), Herwig (Combinatorica 15:365–371, 1995) and Herwig-Lascar (Trans Amer Math Soc 5:1985–2021, 2000), and the set of all total isomorphisms. We observe that every finite graph embeds into a finite vertex transitive graph by a so called bi-embedding, an embedding that is compatible with a monomorphism between the corresponding automorphism groups. We also show that every countable graph bi-embeds into Rado’s universal countable graph Γ.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alon, N., Lefmann, H., Rödl, V.: On an anti-Ramsey type result, Colloq. Math. Soc. János Bolyai 60; Sets, Graphs and Numbers, Budapest (Hungary), pp. 9–22 (1991)

  2. Babai L.: An anti-Ramsey theorem. Graphs Combin. 1(1), 23–28 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  3. Babai L., Sós V.T.: Sidon sets in groups and induced subgraphs of Cayley graphs. European J. Combin. 6(2), 101–114 (1985)

    MathSciNet  MATH  Google Scholar 

  4. Chadzidakis Z., Hrushovski E.: Model theory of differential fields. Trans. Amer. Math. Soc. 351(8), 2997–3071 (1999)

    Article  MathSciNet  Google Scholar 

  5. Erdős, P., Hajnal, A., Pósa, L.: Strong embeddings of graphs into colored graphs. Infinite and finite sets (Colloq. Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), 1, 585–595

  6. Fox J., Sudakov B.: Induced Ramsey-type theorems. Adv. Math. 219(6), 1771–1800 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Graham R.L., Rothschild B.L., Spencer J.H.: Ramsey theory. Wiley, New York (1990)

    MATH  Google Scholar 

  8. de Groot J.: Groups represented by homeomorphism groups. Mathematische Annalen 138, 80–102 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  9. Herwig B.: Extending partial isomorphisms on finite structures. Combinatorica 15, 365–371 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Herwig B., Lascar D.: Extending partial automorphisms and the profinite topology on free groups. Trans. Amer. Math. Soc. 5, 1985–2021 (2000)

    Article  MathSciNet  Google Scholar 

  11. Hodges, W.: Model theory. Encyclopedia of mathematics and its applications, vol 42. xiv + 772 pp. Cambridge University Press, Cambridge (1993)

  12. Hodges W., Hodkinson I., Lascar D., Shelah S.: The small index property for ω-stable, ω-categorical structures and the random graph. J London Math Soc 48, 204–218 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hrushovski E.: Extending partial isomorphisms of graphs. Combinatorica 12(4), 411–416 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kohayakawa Y., Prömel H., Rödl V.: Induced Ramsey numbers. Combinatorica 18, 373–404 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kojman M., Shelah S.: Homogeneous families and their automorphism groups. J London Math Soc(2) 52, 303–317 (1995)

    MathSciNet  MATH  Google Scholar 

  16. Kueker, D.: Back and forth arguments in infinitary logic. In: Kueker D.W. (ed.). In memoriam Carol Karp, Springer Lecture Notes in Mathematics, vol. 429, pp. 17–71. Springer, Berlin (1969)

  17. Nešetřil J., Rödl V.: Two proofs of the Ramsey property of the class of finite hypergraphs. European J. Combin. 3(4), 347–352 (1982)

    MathSciNet  Google Scholar 

  18. Nešetřil J., Rödl V.: The Ramsey Property for Graphs with Forbidden Complete Subgraphs. J. Comb. Th. (B) 20, 243–249 (1976)

    Article  MATH  Google Scholar 

  19. Thomas, S.: The Automorphism Tower Problem. Unpublished manuscript (September 2010). 231 pp

  20. Truss, J.: The group of the countable universal graph. Mathematical Proceedings of the Cambridge Philosophical Society 98, no. 2, 213–245 (1985)

  21. Uspenskij V.V.: On the group of isometries of the Urysohn universal metric space. Comment. Math. Univ. Carolin. 31(1), 181–182 (1990)

    MathSciNet  MATH  Google Scholar 

  22. Uspenskij V.V.: On subgroups of minimal topological groups. Topology Appl. 155(14), 1580–1606 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hausdorff Center for Mathematics, Villa Maria, Endenicher Allee 62, 53115, Bonn, Germany

    Stefan Geschke

  2. Department of Mathematics, Ben Gurion University of the Negev, Beer Sheva, Israel

    Menachem Kojman

Authors
  1. Stefan Geschke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Menachem Kojman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Geschke.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Geschke, S., Kojman, M. Symmetrized Induced Ramsey Theory. Graphs and Combinatorics 27, 851–864 (2011). https://doi.org/10.1007/s00373-010-1006-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-010-1006-x

Keywords

Search

Navigation