A note on constructive methods for ramsey numbers
作者:
F. R. K. Chung,
期刊:
Journal of Graph Theory
(WILEY Available online 1981)
卷期:
Volume 5,
issue 1
页码: 109-113
ISSN:0364-9024
年代: 1981
DOI:10.1002/jgt.3190050109
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractLetr(k) denote the least integern‐such that for any graphGonnvertices eitherGor its complementGcontains a complete graphKkonkvertices. in this paper, we prove the following lower bound for the Ramsey numberr(k) by explicit construction:r(k) ≥ exp (c(Logk)4/3[(log logk)1/3] for some constant
点击下载:
PDF
(227KB)
返 回