Article contents
Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets
Published online by Cambridge University Press: 18 May 2009
Extract
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
- Information
- Copyright
- Copyright © Glasgow Mathematical Journal Trust 1981
References
REFERENCES
- 4
- Cited by