๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On ramsey numbers of forests versus nearly complete graphs

โœ Scribed by Gary Chartrand; Ronald J. Gould; Albert D. Polimeni

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
269 KB
Volume
4
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

A formula is presented for the ramsey number of any forest of order at least 3 versus any graph G of order n โ‰ฅ 4 having clique number n โ€ 1. In particular, if T is a tree of order m โ‰ฅ 3, then r(T, G) = 1 + (m โ€ 1)(n โ€ 2).

๐Ÿ“œ SIMILAR VOLUMES

On Book-Complete Graph Ramsey Numbers
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

The ramsey numbers for stripes and one c
The ramsey numbers for stripes and one complete graph
โœ Peter Lorimer ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 244 KB ๐Ÿ‘ 1 views

The Ramsey numbers M,,, n,P,, ..., n,P,), p > 2, are calculated. ## 1. Introduction One class of generalized Ramsey numbers that are known exactly are those for the graphs nP2 which consist of n disjoint paths of length 2; E. J. Cockayne and the author proved in 111 that d r(nlp2, ..., n d P 2 ) =

On the Ramsey number of trees versus gra
On the Ramsey number of trees versus graphs with large clique number
โœ Ronald J. Gould; Michael S. Jacobson ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3

Size ramsey numbers of stars versus 4-ch
Size ramsey numbers of stars versus 4-chromatic graphs
โœ Oleg Pikhurko ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 124 KB ๐Ÿ‘ 1 views

## Abstract We investigate the asymptotics of the size Ramsey number __รฎ__(__K__~1,__n__~__F__), where __K__~1,__n__~ is the __n__โ€star and __F__ is a fixed graph. The author 11 has recently proved that __rฬ‚__(__K__~1,n~,__F__)=(1+__o__(1))__n__^2^ for any __F__ with chromatic number ฯ‡(__F__)=3. He