\magnification=1440
\font\bigtenrm=cmr10 scaled\magstep4
Abstract for Ermelinda DeLaVina and Siemion Fajtlowicz, Ramseyan Properties of Graphs

 Every graph of chromatic number $k$ with more than $k(r-1)(b-1)$
vertices has a $b$-element independent set of  vertices such that if any 
two of them are joined by an edge then 
the chromatic number stays the same or a $r$-element independent set of 
vertices such that joining any two of them by an edge increases the 
chromatic number.


\bye

.
