Publications of (and about) Paul Erdös
Autor: Erdös, Paul; Faudree, Ralph J.; Rousseau, C.C.; Schelp, R.H.
Title: Tree-multipartite graph Ramsey numbers. (In English)
Source: Graph theory and combinatorics, Proc. Conf. Hon. P. Erdös, Cambridge 1983, 155-160 (1984).
Review: [For the entire collection see Zbl 543.00003.]
Given graphs G and H, r(G,H) is the smallest integer r so that, if one colors the edges of the complete graph on r vertices with two colors then there exist either a copy of G with all of its edges colored by the first color or a copy of H with all of its edges colored by the second color. In this paper theauthors study r(G,H) where G is a tree and H is a complete multipartite graph.
Classif.: * 05C55 Generalized Ramsey theory
Keywords: Ramsey number; tree; complete multipartite graph
Citations: Zbl 543.00003
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag