✦ LIBER ✦

A note on constructive methods for ramsey numbers

✍ Scribed by F. R. K. Chung

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 227 KB
Volume: 5
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190050109

No coin nor oath required. For personal study only.

✦ Synopsis

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: r(k) ≥ exp (c(Log k)^4/3^[(log log k)^1/3^] for some constant c> 0.

📜 SIMILAR VOLUMES

A Note on Constructive Lower Bounds for

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

✍ F.R.K. Chung; R. Cleve; P. Dagum 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 189 KB

A note on Ramsey numbers for books

✍ Vladimir Nikiforov; Cecil C. Rousseau 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## 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__

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

On ramsey numbers for books

✍ C. C. Rousseau; J. Sheehan 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 479 KB

For n = 1, 2, . . . , let 6, = K2+ K,,. We pose the problem of determining the Ramsey numbers r(&, B,) and demonstrate that in many cases critical colorings are available from known examples of strongly regular graphs.

On irredundant Ramsey numbers for graphs

✍ Johannes H. Hattingh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

## Abstract The irredundant Ramsey number __s(m, n)__ is the smallest p such that in every two‐coloring of the edges of __K~p~__ using colors red (__R__) and blue (__B__), either the blue graph contains an __m__‐element irredundant set or the red graph contains an __n__‐element irredundant set. We

On ramsey-tuŕan numbers for 3-graphs

✍ A. F. Sidorenko 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract For every __r__‐graph __G__ let π(__G__) be the minimal real number ϵ such that for every ϵ < 0 and __n__ ϵ __n__~0~(λ, __G__) every __R__‐graph __H__ with __n__ vertices and more than (π + ϵ)(nr) edges contains a copy of __G__. The real number λ(__G__) is defined in the same way, addin