Name
Abstract | ||
|---|---|---|
In this note we will obtain some lower bounds for the Ramsey numbers rk(l;r), where rk(l;r) is the least positive integer n such that for every coloring of the k-element subsets of an n-element set with r colors there always exists an l-element set, all of whose k-element subsets are colored the same. In particular, improving earlier results of Hirschfeld and complementing results of Erdös, Hajnal and Rado, we will show for r¿ 3 that rk(l;r), l¿k+1, grows like a tower, while determining the growth of rk(k+1;2) remains a problem. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0012-365X(93)E0139-U | Discrete Mathematics |
Keywords | DocType | Volume |
ramsey numbers rk,shift graph,lower bound | Journal | 137 |
Issue | ISSN | Citations |
1 | 0012-365X | 1 |
PageRank | References | Authors |
0.40 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dwight Duffus | 1 | 111 | 36.63 |
| Hanno Lefmann | 2 | 484 | 94.24 |
| Vojtěch Rödl | 3 | 887 | 142.68 |