Name
Abstract | ||
|---|---|---|
For bipartite graphs F and H and a positive integer s, the s-bipartite Ramsey number BRs(F,H) of F and H is the smallest integer t with t >= s such that every red-blue coloring of K-s,K-t results in a red F or a blue H. We evaluate this number for all positive integers s when F = K-2,K-2 and H is an element of {K-2,K-3,K-3,K-3}. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.7151/dmgt.2034 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
Ramsey number,bipartite Ramsey number,s-bipartite Ramsey number | Discrete mathematics,Combinatorics,Bipartite graph,Ramsey's theorem,Mathematics | Journal |
Volume | Issue | ISSN |
38 | 2 | 1234-3099 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhenming Bi | 1 | 0 | 0.68 |
| Gary Chartrand | 2 | 199 | 32.05 |
| Ping Zhang | 3 | 292 | 47.70 |