Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-22T20:46:40.856Z Has data issue: false hasContentIssue false

Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets

Published online by Cambridge University Press:  18 May 2009

Frank Harary
Affiliation:
University of Michigan, Ann Arbor, U.S.A.
Heiko Harborth
Affiliation:
Technische Universität Braunschweig, West Germany
Ingrid Mengersen
Affiliation:
Technische Universität Braunschweig, West Germany
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.

Following the notation in Faudree and Schelp [3], we write G → (F, H) to mean that every 2-coloring of E(G), the edge set of G, contains a green (the first color) F or a red (the second color) H. Then the Ramsey number r(F, H) of two graphs F and H with no isolated vertices has been defined as the minimum p such that Kp → (F, H).

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1981

References

REFERENCES

1.Beineke, L. W. and Schwenk, A. J., On a bipartite form of the Ramsey problem, Proc. Fifth British Combinatorial Conference (Utilitas, Winnipeg (1976) 1722).Google Scholar
2.Bollobás, B., Extremal graph theory (Academic Press, London, 1978).Google Scholar
3.Faudree, R. J. and Schelp, R. H., Path—path Ramsey—type numbers for the complete bipartite graph, J. Combinatorial Theory Ser. B 19 (1975) 161173.CrossRefGoogle Scholar
4.Harary, F., Graph theory (Addisop-Wesley, Reading, Mass., 1969).CrossRefGoogle Scholar
5.Harary, F., The foremost open problems in generalized Ramsey theory, Proc. Fifth British Combinatorial Conference (Utilitas, Winnipeg (1976) 269282).Google Scholar
6.Harborth, H. and Nitzschke, H.-M., Solution of Irving's Ramsey problem, Glasgow Math. J. 21 (1980), 187197.CrossRefGoogle Scholar
7.Irving, R. W., A bipartite Ramsey problem and the Zarankiewicz numbers, Glasgow Math. J. 19 (1978), 1326.CrossRefGoogle Scholar