Skip to main content
SpringerLink
Log in

Some universal graphs

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

Abstract

It is shown that various classes of graphs have universal elements. In particular, for eachn the class of graphs omitting all paths of lengthn and the class of graphs omitting all circuits of length at leastn possess universal elements in all infinite powers.

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. R. Fraissé,Sur l’extension aux relations de quelques propriétés des ordres, Ann. Sci. Ecole Norm. Sup.71 (1954), 361–388.

    Google Scholar 

  2. H. Herre, A. Mekler and K. Smith,Superstable graphs, Fund. Math.118 (1983), 75–79.

    MATH  MathSciNet  Google Scholar 

  3. A. Hajnal and J. Pach,Monochromatic paths in infinite graphs, inFinite and Infinite Sets, Coll. Math. Soc. J. Bolyai, Eger, 1981, pp. 359–369.

    Google Scholar 

  4. P. Komjáth and J. Pach,Universal graphs without large bipartite subgraphs, Mathematika31 (1984), 282–290.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Lachlan and R. Woodrow,Countable ultrahomogeneous undirected graphs, Trans. Am. Math. Soc.262 (1980), 51–94.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Mekler,Universal structures in power ℵ1, submitted.

  7. J. Pach,A problem of Ulam on planar graphs, Eur. J. Comb.2 (1981), 357–361.

    MATH  MathSciNet  Google Scholar 

  8. K. Podewski and M. Ziegler,Stable graphs, Fund. Math.110 (1978), 101–107.

    MathSciNet  Google Scholar 

  9. R. Rado,Universal graphs and universal functions, Acta Arith.9 (1964), 331–340.

    MATH  MathSciNet  Google Scholar 

  10. R. Rado,Universal graphs, inA Seminar in Graph Theory (Harary and Beineke, eds.), Holt, Rinehart and Winston Co., 1967.

  11. S. Shelah,Notes in combinatorial set theory, Isr. J. Math.14 (1973), 262–277.

    Article  MATH  Google Scholar 

  12. S. Shelah,On universal graphs without instances of CH, Ann. Pure Appl. Logic2 (1984), 75–87.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, R. Eötvös University, Múzeum krt. 6-8, 1088, Budapest, Hungary

    Peter Komjáth

  2. Department of Mathematics and Statistics, Simon Fraser University, V5A 1S6, Burnaby, British Columbia, Canada

    Alan H. Mekler

  3. Mathematical Institute of the Hungarian Academy of Sciences, Reáltanoda u. 13-15, H-1053, Budapest, Hungary

    János Pach

Authors
  1. Peter Komjáth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan H. Mekler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. János Pach
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research partially supported by Hungarian Science Research Fund No. 1805.

Research partially supported by NSERC of Canada Grant #A8948.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Komjáth, P., Mekler, A.H. & Pach, J. Some universal graphs. Israel J. Math. 64, 158–168 (1988). https://doi.org/10.1007/BF02787220

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation