Name
Abstract | ||
|---|---|---|
For graphs F, G1, ..., Gr, we write F → (G1, ...., Gr) if for every coloring of the vertices of F with r colors there exists i, i = 1, 2, ..., r, such that a copy of Gi is colored with the ith color. For two families of graphs G1, ..., Gr and H1, ..., Hs, by (G1, ..., Gr) → (H1, ..., Hs) we denote the fact that F → (G1, ..., Gr) implies F → (H1, ..., Hs) for every graph F. In this paper, we give necessary and sufficient conditions for (G1, ..., Gr) → (H1, ..., Hs) under some weak assumptions on the families of G1, ..., Gr, and H1, ..., Hs. We also consider the induced version of this problem. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1006/jctb.2001.2078 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
sufficient condition,induced version,graphs f,ith color,graph f.,vertex ramsey property,weak assumption,graphs g1,r color | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Mathematics | Journal |
Volume | Issue | ISSN |
84 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
3 | 0.77 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Łuczak | 1 | 225 | 40.26 |
| Andrzei Ruciński | 2 | 3 | 0.77 |
| Sebastian Urbanski | 3 | 14 | 2.54 |