Name
Abstract | ||
|---|---|---|
The Ramsey number r ( H , K n ) is the smallest integer N so that each graph on N vertices that fails to contain H as a subgraph has independence number at least n. It is shown that r(K 2,m ,K n )⩽(m−1+ o (1))(n/ log n) 2 and r(C 2m ,K n )⩽c(n/ log n) m/(m−1) for m fixed and n →∞. Also r(K 2,n ,K n )=Θ(n 3 / log 2 n) and r(C 5 ,K n )⩽cn 3/2 / log n . Keywords Ramsey numbers Bipartite graphs Complete graphs |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0012-365X(99)00399-4 | Discrete Mathematics |
Keywords | Field | DocType |
complete graph,bipartite graph,ramsey number,bipartite graphs,ramsey numbers | Complete bipartite graph,Discrete mathematics,Combinatorics,Edge-transitive graph,Graph power,Clebsch graph,Ramsey's theorem,Factor-critical graph,Triangle-free graph,Mathematics,Pancyclic graph | Journal |
Volume | Issue | ISSN |
220 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
10 | 0.84 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yair Caro | 1 | 406 | 84.73 |
| Yusheng Li | 2 | 85 | 23.73 |
| Cecil C. Rousseau | 3 | 85 | 14.21 |
| Yuming Zhang | 4 | 10 | 1.52 |