𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fan-complete graph Ramsey numbers

✍ Scribed by Li, Yusheng; Rousseau, Cecil C.

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
427 KB
Volume
23
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ SIMILAR VOLUMES

Local and meank-Ramsey numbers for compl
Local and meank-Ramsey numbers for complete graphs
✍ Schelp, R. H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 67 KB πŸ‘ 1 views

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.

CO-irredundant Ramsey numbers for graphs
CO-irredundant Ramsey numbers for graphs
✍ E. J. Cockayne; G. MacGillivray; J. Simmons πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 120 KB
On graphs with linear Ramsey numbers
On graphs with linear Ramsey numbers
✍ R. L. Graham; V. RΓΆdl; A. RuciΕ„ski πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 141 KB
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

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

Scattering number in graphs
Scattering number in graphs
✍ Shenggui Zhang; Ziguo Wang πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 75 KB