where G is the class of all graphs on n vertices with e edges. Thus, \chis(n,e,L) is an ``extremal anti- Ramsey number''. This paper is devoted to the study of these numbers. It contains some specific values, some bounds and some asymptotic results. It closes with a discussion of several interesting open questions.
Classif.: * 05C55 Generalized Ramsey theory
05C15 Chromatic theory of graphs and maps
Keywords: extremal anti-Ramsey number
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag
|Books||Problems||Set Theory||Combinatorics||Extremal Probl/Ramsey Th.|
|Graph Theory||Add.Number Theory||Mult.Number Theory||Analysis||Geometry|
|Probabability||Personalia||About Paul Erdös||Publication Year||Home Page|