| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654206 | European Journal of Combinatorics | 2010 | 4 Pages |
Abstract
Let integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors. Using an algebraic construction it is shown that rk(Km,n)â¥km(nân0.525) for large n.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Lin Dong, Yusheng Li,