On Size Ramsey Number of Paths, Trees and Circuits. II

  • József Beck
Part of the Algorithms and Combinatorics book series (AC, volume 5)

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 GH to mean that if the edges of G are coloured by two colours, then G contains a monochromatic copy of H.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beck, J. (1983): On size Ramsey number of paths, trees, and circuits I. J. Graph Theory 7, 115–129MathSciNetMATHCrossRefGoogle Scholar
  2. Erdos, P., Faudree, E.J., Rousseau, C.C., Schelp, R.H. (1978): The size Ramsey number. Period. Math. Hung. 9, 145–161MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • József Beck

There are no affiliations available

Personalised recommendations