A note on contraction numbers for additive correction methods
β Scribed by S.H. Chou; T.A. Porsching
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 219 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Let __r(k__) denote the least integer __n__βsuch that for any graph __G__ on __n__ vertices either __G__ or its complement G contains a complete graph __K__~k~ on __k__ vertices. in this paper, we prove the following lower bound for the Ramsey number __r(k__) by explicit construction: _
## Abstract The __book with n pages__ __B__~__n__~ is the graph consisting of __n__ triangles sharing an edge. The __book Ramsey number__ __r__(__B__~__m__~,__B__~__n__~) is the smallest integer __r__ such that either __B__~__m__~βββ__G__ or __B__~__n__~βββ__G__ for every graph __G__ of order __r__