✦ LIBER ✦

Local and meank-Ramsey numbers for complete graphs

✍ Scribed by Schelp, R. H.

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 67 KB
Volume: 24
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199703)24:3<201::aid-jgt1>3.0.co;2-t

No coin nor oath required. For personal study only.

✦ Synopsis

This paper establishes that the local k-Ramsey number R(K m , k -loc) is identical with the mean k-Ramsey number R(K m , k -mean). This answers part of a question raised by Caro and Tuza.

📜 SIMILAR VOLUMES

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).

CO-irredundant Ramsey numbers for graphs

✍ E. J. Cockayne; G. MacGillivray; J. Simmons 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 1 views

Independence numbers of locally sparse g

Independence numbers of locally sparse graphs and a Ramsey type problem

✍ Noga Alon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

Let G = (V, E ) be a graph on n vertices with average degree t 2 1 in which for every vertex u E V the induced subgraph on the set of all neighbors of u is r-colorable. We show that the independence number of G is at least log t , for some absolute positive constant c. This strengthens a well-known

On graphs with linear Ramsey numbers

✍ R. L. Graham; V. Rödl; A. Ruciński 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

The Ramsey number for a cycle of length

The Ramsey number for a cycle of length five vs. a complete graph of order six

✍ Chula J. Jayawardene; Cecil C. Rousseau 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

Upper bounds for ramsey numbers R(3, 3,

Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers

✍ Wan, Honghui 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB 👁 1 views

In this paper we show that for n ≥ 4, R(3, 3, . . . , 3) < n!( e-e -1 + 3 2 ) + 1. Consequently, a new bound for Schur numbers is also given. Also, for even n ≥ 6, the Schur number S n is bounded by S n < n!( e-e -1 + 3 2 ) -n + 2.