On the minimum degree of minimal Ramsey graphs
- 25 August 2009
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 64 (2) , 150-164
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 larger chromatic number. Numerous interesting problems remain open. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 150–164, 2010Keywords
This publication has 6 references indexed in Scilit:
- Small Ramsey NumbersThe Electronic Journal of Combinatorics, 2011
- The minimum degree of Ramsey‐minimal graphsJournal of Graph Theory, 2006
- The Ramsey number R(3, t) has order of magnitude t2/log tRandom Structures & Algorithms, 1995
- Simple proof of the existence of restricted ramsey graphs by means of a partite constructionCombinatorica, 1981
- The size Ramsey numberPeriodica Mathematica Hungarica, 1978
- Some remarks on the theory of graphsBulletin of the American Mathematical Society, 1947