Hostname: page-component-848d4c4894-hfldf Total loading time: 0 Render date: 2024-04-30T18:23:19.391Z Has data issue: false hasContentIssue false
  • English
  • Français

The Ramsey number for stripes

Published online by Cambridge University Press:  09 April 2009

E. J. Cockayne  and
P. J. Lorimer
E. J. Cockayne
Affiliation:
Department of Mathematics, University of AucklandNew Zealand
P. J. Lorimer
Affiliation:
Department of Mathematics, University of VictoriaBritish Columbia, Canada
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

If G1,…,Gc are graphs without loops or multiple edges there is a smallest integer r(G1,…,Gc) such that if the edges of a complete graph Kn, with n ≧ r(G1,…,Gc), are painted arbitrarily with c colours the ith coloured subgraph contains Gi as a subgraph for at least one i. r(G1,…Gc) is called the Ramsey number of the graphs G1,…,Gc.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 19 , Issue 2 , March 1975 , pp. 252 - 256
Copyright
Copyright © Australian Mathematical Society 1975

References

Cockayne, E. J. (1970), ‘An application of Ramseys Theorem’, Can. Math. Bull. 13, 145–146.CrossRefGoogle Scholar
Cockayne, E. J. (1972), ‘Colour Classes for r-graphs’, Can. Math. Bull. 15, 349–354.CrossRefGoogle Scholar
Harary, F. (1969), Graph Theory (Addison-Wesley, Reading. Mass 1969).CrossRefGoogle Scholar
Harary, F. (1972), Recent results on generalised Ramsey Theory for Graphs. (To appear in proceedings of Kalmazoo Conf. on Graph Theory 1972).CrossRefGoogle Scholar
Harary, F. and Chratal, V. (to appear), ‘Generalised Ramsey Theory for Graphs’, Bull. Amer. Math. Soc.Google Scholar
Ramsey, F. P. (1930), ‘On a problem of formal logic’, Proc. London Math. Soc. 30, 264–286.CrossRefGoogle Scholar