Name
Abstract | ||
|---|---|---|
A balanced complete k-partite graph, k >= 2, is a complete k-partite graph the degrees of whose vertices differ by at most 1. For graphs F and H and an integer k with 2 <= k <= R(F, H), where R(F, H) is the Ramsey number of F and H, the k-Ramsey number R-k(F, H) of F and H, if it exists, is the smallest order of a balanced complete k-partite graph G for which every red blue coloring of the edges of G results in a red F or a blue H. For an integer t >= 3, the unicyclic-star graph U-t is the unicyclic graph containing the star K1,t as a spanning subgraph. The k-Ramsey numbers R-k(U-t) = R-k(U-t, U-t) are determined for many pairs k, t of positive integers. |
Year | Venue | Keywords |
|---|---|---|
2018 | ARS COMBINATORIA | Ramsey number,balanced complete multipartite graph,unicyclic-star graph |
Field | DocType | Volume |
Graph,Discrete mathematics,Combinatorics,Ramsey's theorem,Mathematics | Journal | 137 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Johnston | 1 | 2 | 1.08 |
| Chira Lumduanhom | 2 | 2 | 1.79 |
| Ping Zhang | 3 | 292 | 47.70 |