𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Ramsey Minimal Graphs

✍ Scribed by Rödl, V.; Siggers, M.

Book ID
118196922
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
305 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Ramsey -minimal graphs
On Ramsey -minimal graphs
✍ Borowiecka-Olszewska, Marta; Hałuszczak, Mariusz 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 535 KB
On the minimum degree of minimal Ramsey
On the minimum degree of minimal Ramsey graphs
✍ Tibor Szabó; Philipp Zumstein; Stefanie Zürcher 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

## Abstract We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr et al. We determine the corresponding graph parameter for numerous bipartite graphs, including bi‐regular bipartite graphs and forests. We also make initial progress for graphs of l

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

On highly ramsey infinite graphs
On highly ramsey infinite graphs
✍ M. H. Siggers 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract We show that, for __r__ ≥ 2 and __k__ ≥ 3, there exists a positive constant __c__ such that for large enough __n__ there are 2 non‐isomorphic graphs on at most __n__ vertices that are __r__‐ramsey‐minimal for the odd cycle __C__~2__k__+1~. © 2008 Wiley Periodicals, Inc. J Graph Theory 5