On Size Ramsey Number of Paths, Trees and Circuits. II
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.
Unable to display preview. Download preview PDF.