Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T20:51:34.667Z 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).

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1981