Infinite Graphs

Abstract

Considering infinite graphs, the picture is, even in the case of countable graphs, far from being complete.

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Cameron, P.J.: Aspects of the random graph. In: Graph Theory and Combinatorics (Cambridge, 1983), pp. 65–79. Academic, London (1984)
Google Scholar
El-Zahar, M., Sauer, N.: The indivisibility of the homogeneous k _n-free graphs. J. Comb. Theory B 47, 162–170 (1989)
Article MathSciNet MATH Google Scholar
Erdős, P., Rényi, A.: Asymmetric graphs. Acta Math. Acad. Sci. Hung. 14, 295–315 (1963)
Article Google Scholar
Erdős, P., Hajnal, A., Pósa, L.: Strong embeddings of graphs into colored graphs. In: Infinite And Finite Sets (Colloq., Keszthely, 1973; Dedicated to P. Erdős on his 60th Birthday), vol. I, pp. 585–595. North-Holland, Amsterdam (1975)
Google Scholar
Erdős, P., Hajnal, A., Máté, A., Rado, R.: Combinatorial Set Theory: Partition Relations for Cardinals. North-Holland, Amsterdam (1984)
Google Scholar
Henson, C.: A family of countable homogeneous graphs. Pac. J. Math. 38, 69–83 (1971)
Article MathSciNet Google Scholar
Komjáth, P., Rödl, V.: Coloring of universal graphs. Graphs Comb. 2, 55–60 (1986)
Article MATH Google Scholar
Rado, R.: Universal graphs and universal functions. Acta Arith. 9, 331–340 (1964)
MathSciNet MATH Google Scholar

Authors

Hans Jürgen Prömel
View author publications
You can also search for this author in PubMed Google Scholar

Prömel, H.J. (2013). Infinite Graphs. In: Ramsey Theory for Discrete Structures. Springer, Cham. https://doi.org/10.1007/978-3-319-01315-2_13