𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t)

✍ Scribed by F.R.K. Chung; R. Cleve; P. Dagum

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
189 KB
Volume
57
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A constructive approach for the lower bo
A constructive approach for the lower bounds on the Ramsey numbers R (s, t)
✍ Xu Xiaodong; Xie Zheng; StanisΕ‚aw P. Radziszowski πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 89 KB πŸ‘ 1 views

## Abstract Graph __G__ is a (__k__, __p__)‐graph if __G__ does not contain a complete graph on __k__ vertices __K__~__k__~, nor an independent set of order __p__. Given a (__k__, __p__)‐graph __G__ and a (__k__, __q__)‐graph __H__, such that __G__ and __H__ contain an induced subgraph isomorphic t

A note on constructive methods for ramse
A note on constructive methods for ramsey numbers
✍ F. R. K. Chung πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 227 KB πŸ‘ 1 views

## 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: _

An upper bound on the ramsey number R(K3
An upper bound on the ramsey number R(K3, G) depending only on the size of the graph G
✍ A. F. Sidorenko πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 1 views

## Abstract Harary stated the conjecture that for any graph __G__ with __n__ edges and without isolated vertices __r__(__K__~3~,__G__) β©½ 2__n__ + 1. ErdΓΆs, Faudree, Rousseau, and Schelp proved that __r__(__K__~3~,__G__) β©½ ⌈8/3__n__βŒ‰. Here we prove that __r__(__K__~3~,__G__) β©½ ⌊5/2__n__βŒ‹ βˆ’1 for __n_