𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ramsey-minimal graphs for multiple copies

✍ Scribed by S.A. Burr; P. Erdös; R.J. Faudree; C.C. Rousseau; R.H. Schelp

Book ID
108495256
Publisher
Elsevier Science
Year
1978
Weight
487 KB
Volume
81
Category
Article
ISSN
1385-7258

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Ramsey Minimal Graphs
On Ramsey Minimal Graphs
✍ Rödl, V.; Siggers, M. 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 305 KB
On Ramsey -minimal graphs
On Ramsey -minimal graphs
✍ Borowiecka-Olszewska, Marta; Hałuszczak, Mariusz 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 535 KB
On zero sum Ramsey numbers: Multiple cop
On zero sum Ramsey numbers: Multiple copies of a graph
✍ A. Bialostocki; P. Dierker 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 376 KB 👁 1 views

## Abstract As a consequence of our main result, a theorem of Schrijver and Seymour that determines the zero sum Ramsey numbers for the family of all __r__‐hypertrees on __m__ edges and a theorem of Bialostocki and Dierker that determines the zero sum Ramsey numbers for __r__‐hypermatchings are com

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

The minimum degree of Ramsey-minimal gra
The minimum degree of Ramsey-minimal graphs
✍ Jacob Fox; Kathy Lin 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract We write __H__ → __G__ if every 2‐coloring of the edges of graph __H__ contains a monochromatic copy of graph __G__. A graph __H__ is __G__‐__minimal__ if __H__ → __G__, but for every proper subgraph __H__′ of __H__, __H__′ ↛ __G__. We define __s__(__G__) to be the minimum __s__ such th