On the minimum degree of minimal Ramsey graphs

We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. 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 larger chromatic number. Numerous interesting problems remain open.

• Type: Journal
• Year: 2010
• Where: JGT
• Authors: Tibor Szabó, Philipp Zumstein, Stefanie Zürcher
• Keywords: Bipartite Graphs, JGT 2010, Minimal Ramsey Graphs, Numerous Bipartite Graphs