Name
Abstract | ||
|---|---|---|
It has been conjectured that r(Cn, Km) = (m - 1)(n - 1) + 1 for all (n, m) ≠ (3,3) satisfying n ≥ m. We prove this for the case m = 5. |
Year | DOI | Venue |
|---|---|---|
2000 | null | Australasian J. Combinatorics |
Keywords | DocType | Volume |
null | Journal | 22 |
Issue | ISSN | Citations |
null | 22023518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bela Bollobas | 1 | 66 | 12.05 |
| Chula J. Jayawardene | 2 | 2 | 2.34 |
| Jiansheng Yang | 3 | 0 | 0.68 |
| Huangyi Ru | 4 | 0 | 0.34 |
| Cecil C. Rousseau | 5 | 0 | 0.68 |
| Zhangke Min | 6 | 0 | 0.68 |