Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-13T12:43:29.704Z Has data issue: false hasContentIssue false
  • English
  • Français

On Ramsey Graph Numbers for Stars and Stripes

Published online by Cambridge University Press:  20 November 2018

E. J. Cockayne  and
P. J. Lorimer
E. J. Cockayne
Affiliation:
University of Victoria Victoria, British Columbia
P. J. Lorimer
Affiliation:
University of Auckland, New Zealand
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.

Any term or symbol undefined in this paper is defined in [5]. For graphs F and G, G > F means G contains a subgraph isomorphic to F and E(G) denotes the edge set of G. If E ⊆ E(G), 〈E〉 is the subgraph of G whose edge set is E and whose vertex set is that subset of vertices of G which are incident with edges in E.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 18 , Issue 1 , April 1975 , pp. 31 - 34
Copyright
Copyright © Canadian Mathematical Society 1975

References

1. Burr, S., Generalised Ramsey Theory for Graphs—A Survey, To appear in Graphs and Combinatorics 1973 (Bari, R. and Harary, F. eds.) Springer-Verlag, Berlin.Google Scholar
2. Burr, S. and Roberts, J., On Ramsey Numbers for Stars, To appear Utilitas Math.Google Scholar
3. Cockayne, E. J., An application of Ramsey's Theorem, Can. Math. Bull., Vol. 13 No. 1 1970), 145-6.Google Scholar
4. Cockayne, E. J., Colour Classes for r-graphs, Can. Math. Bull, Vol. 15 No. 3 (1972), 349-354.Google Scholar
5. Harary, F., Graph Theory, Addison-Wesley, Reading, Mass. 1969.Google Scholar
6. Harary, F., Recent results on generalised Ramsey Theory for Graphs, To appear Proceedings of Kalamazoo Conference on Graph Theory 1972.Google Scholar
7. Ramsey, F. P., On a problem of formal logic, Proc. London Math. Soc, Vol. 30 (1930), 264-286.Google Scholar