Abstract
In this paper we shall demonstrate that random graphs satisfy some interesting Ramsey type properties. This paper deals with finite, simple and undirected graphs only. If G and H are graphs, write G → H to mean that if the edges of G are coloured by two colours, then G contains a monochromatic copy of H.
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
Preview
Unable to display preview. Download preview PDF.
References
Beck, J. (1983): On size Ramsey number of paths, trees, and circuits I. J. Graph Theory 7, 115–129
Erdos, P., Faudree, E.J., Rousseau, C.C., Schelp, R.H. (1978): The size Ramsey number. Period. Math. Hung. 9, 145–161
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Beck, J. (1990). On Size Ramsey Number of Paths, Trees and Circuits. II. In: Nešetřil, J., Rödl, V. (eds) Mathematics of Ramsey Theory. Algorithms and Combinatorics, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72905-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-72905-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72907-2
Online ISBN: 978-3-642-72905-8
eBook Packages: Springer Book Archive