首页   按字顺浏览 期刊浏览 卷期浏览 An upper bound on the ramsey numberR(K3,G) depending only on the size of the graphG
An upper bound on the ramsey numberR(K3,G) depending only on the size of the graphG

 

作者: A. F. Sidorenko,  

 

期刊: Journal of Graph Theory  （WILEY Available online 1991）
卷期: Volume 15, issue 1  

页码: 15-17

 

ISSN:0364-9024

 

年代: 1991

 

DOI:10.1002/jgt.3190150104

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractHarary stated the conjecture that for any graphGwithnedges and without isolated verticesr(K3,G) ⩽ 2n+ 1. Erdös, Faudree, Rousseau, and Schelp proved thatr(K3,G) ⩽ ⌈8/3n⌉. Here we prove thatr(K3,G) ⩽ ⌊5/2

 

点击下载:  PDF (135KB)



返 回