✦ LIBER ✦

On Ramsey numbers for special complete distance graphs

✍ Scribed by A. M. Raigorodskii

Book ID: 110149214
Publisher: SP MAIK Nauka/Interperiodica
Year: 2007
Tongue: English
Weight: 543 KB
Volume: 82
Category: Article
ISSN: 0001-4346
DOI: 10.1134/s0001434607090155

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On multicolor Ramsey numbers for complet

On multicolor Ramsey numbers for complete bipartite graphs

✍ Fan R.K Chung; R.L Graham 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 268 KB

On cycle—Complete graph ramsey numbers

✍ P. Erdös; R. J. Faudree; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 507 KB

A new upper bound is given for the cycle-complete graph Ramsey number r(Cm, K,,), the smallest order for a graph which forces it to contain either a cycle of order m or a set of n independent vertices. Then, another cycle-complete graph Ramsey number is studied, namely r(sCm, K,) the smallest order

On Book-Complete Graph Ramsey Numbers

✍ Yusheng Li; C.C. Rousseau 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 274 KB

It is shown that a graph of order N and average degree d that does not contain the book B m =K 1 +K 1, m as a subgraph has independence number at least Nf (d ), where f (x)t(log xÂx) (x Ä ). From this result we find that the book-complete graph Ramsey number satisfies r(B m , K n ) mn 2 Âlog(nÂe). I

On the Ramsey numbers for complete dista

On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$

✍ Mikhailov, Kirill A; Raigorodskii, Andrei M 📂 Article 📅 2009 🏛 Turpion Limited 🌐 English ⚖ 391 KB

On Canonical Ramsey Numbers for Complete

On Canonical Ramsey Numbers for Complete Graphs versus Paths

✍ H. Lefmann; V. Rodl 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Fan-complete graph Ramsey numbers

✍ Li, Yusheng; Rousseau, Cecil C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB 👁 2 views

It is shown that if G and H are arbitrary fixed graphs and n is sufficiently large, then Also, we prove that r ( K 1 +F, K,) 5 (m+o(l))&(n -+ GO) for any forest Fwhose largest component has m edges. Thus r(Fe, K,) 5 (1 + o(l))&, where Fe = K1 + CK2. We conjecture that r(Fe, K,) -&(n + cm).