𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Ramsey multiplicity for stars

✍ Scribed by Michael S. Jacobson

Book ID
103057620
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
431 KB
Volume
42
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In 1929, Ramsey proved a theorem guaranteeing that if G1, G,, . . . , Gk are graphs, then there exists an integer r so that if the edges of EC, are colored in any fashion with k colors a monochromatic G* in color i exists for some i Harary and Prins suggested the problem of deciding the minimum number of monochromatic Gi in any such coloring. It is the purpose of this paper to establish this minimum number in the case when G, are stars for each i.

πŸ“œ SIMILAR VOLUMES

A note on Ramsey multiplicity
A note on Ramsey multiplicity
✍ Michael S. Jacobson πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 186 KB
Generalized Ramsey theory for graphs IV,
Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
✍ F. Harary; G. Prins πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 412 KB

A paopm graph G has no isolated points. I t s R m e y r u m b a r ( G ) i s the m i n i m p such that every 2-coloring of the edges of K contains a monochromatic G. The Ramhey m & t @ m y R(G) i s P the r (G) ' With j u s t one exception, namely Kq, we determine R(G) f o r proper graphs u i t h a t

On zero-sum Ramsey numbersβ€” stars
On zero-sum Ramsey numbersβ€” stars
✍ Yair Caro πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 347 KB

Caro, Y., On zero-sum Ramsey numbers--stars, Discrete Mathematics 104 (1992) l-6. Let n 3 k 2 2 be positive integers, k ( n. Let H, be the cyclic group of order k. Denote by R(K,,,> Z,) the minimal integer t such that for every &-coloring of the edges of K,, (i.e., a function c : E(K,)+ hk), there i