Publications of (and about) Paul Erdös
Autor: Erdös, Paul; Faudree, Ralph J.
Title: Size Ramsey numbers involving matchings. (In English)
Source: Finite and infinite sets, 6th Hung. Combin. Colloq., Eger/Hung. 1981, Vol. I, Colloq. Math. Soc. János Bolyai 37, 247-264 (1984).
Review: [For the entire collection see Zbl 559.00001.]
If G,H are graphs, \hat r(G,H) denotes max|E(F)| for F > (G,H). Several exact and asymptotic results (in terms of n) are given for \hat r(tK2,G) where tK2 is the disjoint union of t edges, G is a "classical" graph on n vertices, i.e. is Kn, Cn, Pn or is obtained by some simple operations.
Classif.: * 05C55 Generalized Ramsey theory
05C70 Factorization, etc.
05C35 Extremal problems (graph theory)
Keywords: general Ramsey-theory; size Ramsey numbers; graphs
Citations: Zbl 559.00001
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag