On Ramsey -minimal graphs
✍ Scribed by Borowiecka-Olszewska, Marta; Hałuszczak, Mariusz
- Book ID
- 120515749
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 535 KB
- Volume
- 313
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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
## 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
## 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