Name
Abstract | ||
|---|---|---|
Following the arrow notation, for a graph G and natural numbers a1,a2,…,ar we write G→(a1,a2,…,ar)v if for every coloring of the vertices of G with r colors there exists a copy of the complete graph Kai of color i for some i=1,2,…,r. We present some constructions of small graphs with this Ramsey property, but not containing large cliques. We also set bounds on the order of the smallest such graphs. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0012-365X(00)00445-3 | Discrete Mathematics |
Keywords | Field | DocType |
complete graph | Edge coloring,Random regular graph,Discrete mathematics,Combinatorics,Indifference graph,Chordal graph,1-planar graph,Mathematics,Triangle-free graph,Graph coloring,Split graph | Journal |
Volume | Issue | ISSN |
236 | 1-3 | 0012-365X |
Citations | PageRank | References |
7 | 1.00 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Łuczak | 1 | 225 | 40.26 |
| Andrzej Rucinski 0001 | 2 | 197 | 30.44 |
| Sebastian Urbanski | 3 | 14 | 2.54 |