Skip to main content
SpringerLink
Log in

Embedding finite graphs into graphs colored with infinitely many colors

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

We prove that for any cardinalτ and for any finite graphH there is a graphG such that for any coloring of the pairs of vertices ofG withτ colors there is always a copy ofH which is an induced subgraph ofG so that both the edges of the copy and the edges of the complement of the copy are monochromatic.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. Deuber,Partitionstheoreme für Graphen, Math. Helv.50 (1975), 311–320.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. Erdős, A. Hajnal and L. Pósa,Strong embedding of graphs into colored graphs, inInfinite and Finite Sets (Keszthely, 1973), Coll. Math. Soc. J. Bolyai10 (1973), 585–595.

    Google Scholar 

  3. A. Hajnal and P. Komjáth,Embedding graphs into colored graphs, Trans. Am. Math. Soc.307 (1988), 395–409.

    Article  MATH  Google Scholar 

  4. J. Nesetril and V. Rödl,Partitions of vertices, Comm. Math. Univ. Caroline17 (1976), 85–95.

    MATH  Google Scholar 

  5. S. Shelah,Consitency of positive partition theorems for graphs and models, Lecture Notes in Math.1401, Springer-Verlag, Berlin, 1989, pp. 167–193.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, The Hungarian Academy of Sciences, P.O.B. 127, H-1364, Budapest, Hungary

    A. Hajnal

Authors
  1. A. Hajnal
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by Hungarian National Science Foundation OTKA grant 1805.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hajnal, A. Embedding finite graphs into graphs colored with infinitely many colors. Israel J. Math. 73, 309–319 (1991). https://doi.org/10.1007/BF02773844

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation