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

Saturation Numbers for Nearly Complete Graphs

โœ Scribed by Ralph J. Faudree, Ronald J. Gould

Book ID
120788680
Publisher
Springer Japan
Year
2012
Tongue
English
Weight
208 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On ramsey numbers of forests versus near
On ramsey numbers of forests versus nearly complete graphs
โœ Gary Chartrand; Ronald J. Gould; Albert D. Polimeni ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 269 KB ๐Ÿ‘ 1 views

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