Name
Abstract | ||
|---|---|---|
Lower bounds on the Ramsey number r ( G , H ), as a function of the size ofthe graphs G and H , are determined. In particular, if H is a graph with n lines, lower bounds for r ( H ) = r ( H , H ) and r (K m , H) are calculated in terms of n in the first case and m and n in the second case. For m = 3 an upper bound is also determined. These results partially answer a question raised by Harary about the relationship between Ramsey numbers and the size of graphs. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1016/0012-365X(87)90173-7 | Discrete Mathematics |
Keywords | Field | DocType |
prescribed size,ramsey problem,lower bound,ramsey number,upper bound | Graph theory,Graph,Discrete mathematics,Combinatorics,Upper and lower bounds,Ramsey's theorem,Ramsey problem,Mathematics | Journal |
Volume | Issue | ISSN |
67 | 3 | Discrete Mathematics |
Citations | PageRank | References |
9 | 1.78 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P Erdös | 1 | 626 | 190.85 |
| R. J. Faudree | 2 | 174 | 38.15 |
| C. C. Rousseau | 3 | 126 | 22.97 |
| R. H. Schelp | 4 | 609 | 112.27 |