##
**Zentralblatt MATH**

**Publications of (and about) Paul Erdös**

**Zbl.No: ** 469.05048

**Autor: ** Burr, Stefan A.; Erdös, Paul; Faudree, Ralph J.; Rousseau, C.C.; Schelp, R.H.

**Title: ** Ramsey-minimal graphs for matchings. (In English)

**Source: ** The theory and applications of graphs, 4th int. Conf., Kalamazoo/Mich. 1980, 159-168 (1981).

**Review: ** [For the entire collection see Zbl 459.00006.]

Let F ––> (G,H) mean that for every 2-coloring (blue and red) of F, then either there exists a red subgraph isomorphic to G or a blue subgraph isomorphic to H. Let R(G,H) be the family of graphs F such that F ––> (G,H) and edge-minimal for this property, that is F'\not in (G,H) for each proper subgraph F' of F. The authors investigate R(G,H) in the special case where G a is t-matching and H a 2-matching.

**Reviewer: ** J.C.Bermond

**Classif.: ** * 05C55 Generalized Ramsey theory

**Keywords: ** generalized Ramsey numbers

**Citations: ** Zbl.459.00006

© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag