✦ LIBER ✦

Some Asymptotic ith Ramsey numbers

✍ Scribed by R.Glenn Powers

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 1017 KB
Volume: 41
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90022-x

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a graph with chromatic number x(G) and let t(tG) be the minimum number of vertices in any color class among all x(G)-vertex colorings of G. Let H' be a connected graph and iet Ii be a graph obtained by subdividing (adding extra vertices toj a fixed edge of I-I'. ii is proved that if the order of H is sufficiently large, the ith Ramsey number ri(G, H) equals [((x(G)--l)(iHI-l)+ t(G)-WI+ 1.

📜 SIMILAR VOLUMES

The ith Ramsey number for matchings

✍ R.Glenn Powers 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 232 KB

The ith Ramsey number for matchings is determined. In addition, our results lead to the calculation of the Ramsey index for matchings. The purpose of this paper is to calculate the ith Ramsey number for matchings. In order to state our results, we will need some notation. Any undefined notation fol

Some small ramsey numbers

✍ M. Clancy 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB

## Abstract In previous work, the Ramsey numbers have been evaluated for all pairs of graphs with at most four points. In the present note, Ramsey numbers are tabulated for pairs __F__~1~, __F__~2~ of graphs where __F__~1~ has at most four points and __F__~2~ has exactly five points. Exact results

Some connected ramsey numbers

✍ R. J. Faudree; R. H. Schelp 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

## Abstract A graph __G__ is co‐connected if both __G__ and its complement __Ḡ__ are connected and nontrivial. For two graphs __A__ and __B__, the connected Ramsey number __r__~c~(__A, B__) is the smallest integer __n__ such that there exists a co‐connected graph of order __n__, and if __G__ is a c

Some properties of Ramsey numbers

✍ Zhongfu Zhang; Linzhong Liu; Jinwen Li; Enmin Song 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Some medications of Ramsey numbers

✍ Izolda Gorgol 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Asymptotic bounds for irredundant and mi

Asymptotic bounds for irredundant and mixed Ramsey numbers

✍ Guantao Chen; Johannes H. Hattingh; Cecil C. Rousseau 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB 👁 1 views

## Abstract The irredundant Ramsey number __s(m, n)__ is the smallest __N__ such that in every red‐blue coloring of the edges of __K__~__N__~, either the blue graph contains an __m__‐element irredundant set or the red graph contains an __n__‐element irredundant set. The definition of the mixed Rams