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

Ramsey numbers for a disjoint union of some graphs

โœ Scribed by Halina Bielak


Book ID
108052420
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
291 KB
Volume
22
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The Ramsey numbers for disjoint unions o
โœ Tristan Denley ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 671 KB

As usual, for simple graphs G and H, let the Ramsey number r(G,H) be defined as the least number n such that for any graph K of order n, either G is a subgraph of K or H is a subgraph of/(. We shall establish the values of r(aC~,bCs) and r(aCv, bC7) almost precisely (where nG is the graph consisting

Local Ramsey numbers for some graphs
โœ Halina Bielak ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 166 KB