##
**Zentralblatt MATH**

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

**Zbl.No: ** 840.05061

**Autor: ** Burr, Stefan A.; Erdös, Paul; Sós, V.T.; Frankl, P.; Graham, Ronald L.

**Title: ** Further results on maximal anti-Ramsey graphs. (In English)

**Source: ** Alavi, Yousef (ed.) et al., Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley & Sons Ltd. Wiley-Interscience Publication, 193-206 (1991).

**Review: ** A well-studied question in graph theory asks the following: Given a graph L and an integer r > 0, which graphs G have the property that no matter how the edges of G are r-colored, a monochromatic copy of L must always occur in G? (More precisely, G has a subgraph isomorphic to L in which all edges have the same color. We will typically use this type of informal description when the measuring is clear.) Indeed, the forthcoming book [*S. A. Burr*, *R. Faudree*, *C. C. Rousseau* and *R. Schelp*, Graphical Ramsey theory (tentative title)] will list several hundred papers which deal with various aspects of this subject. In [*S. A. Burr* et al., J. Graph Theory 13, No. 3, 263-282 (1989; Zbl 682.05046)], we recently initiated a study of a related problem which in a certain sense goes in the opposite direction.

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

**Keywords: ** maximal anti-Ramsey graphs; monochromatic copy; color

**Citations: ** Zbl 682.05046

© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag