Premium
On the minimum degree of minimal Ramsey graphs
Author(s) -
Szabó Tibor,
Zumstein Philipp,
Zürcher Stefanie
Publication year - 2010
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20445
Subject(s) - combinatorics , mathematics , bipartite graph , degree (music) , discrete mathematics , cograph , graph , chordal graph , 1 planar graph , physics , acoustics
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 larger chromatic number. Numerous interesting problems remain open. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 150–164, 2010