Electronic Resource
Springer
Combinatorica
15 (1995), S. 589-596
ISSN:
1439-6912
Keywords:
05 C 55
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract For graphsA andB the relationA→(B) r 1 means that for everyr-coloring of the vertices ofA there is a monochromatic copy ofB inA. Forb (G) is the family of graphs which do not embedG. A familyℱof graphs is Ramsey if for all graphsB∈ℱthere is a graphA∈ℱsuch thatA→(B) r 1 . The only graphsG for which it is not known whether Forb (G) is Ramsey are graphs which have a cutpoint adjacent to every other vertex except one. In this paper we prove for a large subclass of those graphsG, that Forb (G) does not have the Ramsey property.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01192529
Permalink
|
Location |
Call Number |
Limitation |
Availability |
