Abstract
Although our graph theoretic terminology is standard, let us briefly recall the basic definitions, compare also any standard book on graph theory, e.g. Bollobás (1998) and Diestel (2010).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abramson, F.G., Harrington, L.A.: Models without indiscernibles. J. Symb. Log. 43, 572–600 (1978)
Bollobás, B.: Modern Graph Theory. Springer, New York (1998)
Chen, B., Matsumoto, M., Wang, J.F., Zhang, Z.F., Zhang, J.X.: A short proof of Nash-Williams’ theorem for the arboricity of a graph. Graphs Comb. 10, 27–28 (1994)
Deuber, W.: Partitionstheoreme für Graphen. Comment. Math. Helv. 50, 311–320 (1975)
Diestel, R.: Graph Theory, 4th edn. Springer, Heidelberg (2010)
Erdős, P., Hajnal, A., Máté, A., Rado, R.: Combinatorial Set Theory: Partition Relations for Cardinals. North-Holland, Amsterdam (1984)
Folkman, J.: Graphs with monochromatic complete subgraphs in every edge coloring. SIAM J. Appl. Math. 18, 19–24 (1970)
Komjáth, P., Rödl, V.: Coloring of universal graphs. Graphs Comb. 2, 55–60 (1986)
Nešetřil, J., Rödl, V.: Partitions of subgraphs. In: Recent Advances in Graph Theory (Proceedings Second Czechoslovak Symposium, Prague 1974), pp. 413–423. Academia, Prague (1975)
Nešetřil, J., Rödl, V.: The Ramsey property for graphs with forbidden complete subgraphs. J. Comb. Theory B 20, 243–249 (1976b)
Nešetřil, J., Rödl, V.: Partitions of finite relational and set systems. J. Comb. Theory A 22, 289–312 (1977)
Nešetřil, J., Rödl, V.: On a probabilistic graph-theoretical method. Proc. Am. Math. Soc. 72, 417–421 (1978a)
Nešetřil, J., Rödl, V.: Ramsey classes of set systems. J. Comb. Theory A 34, 183–201 (1983b)
Nešetřil, J., Rödl, V.: Two remarks on Ramsey’s theorem. Discrete Math. 54, 339–341 (1985)
Prömel, H.J., Voigt, B.: Recent results in partition (Ramsey) theory for finite lattices. Discrete Math. 35, 185–198 (1981a)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Prömel, H.J. (2013). Finite Graphs. In: Ramsey Theory for Discrete Structures. Springer, Cham. https://doi.org/10.1007/978-3-319-01315-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-01315-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01314-5
Online ISBN: 978-3-319-01315-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)