============================================================
   Seminário de Teoria da Computaçăo e Combinatória (TCC)

                  Tarde de Combinatória
============================================================

Título:      Minimum degree of minimal Ramsey graphs for 
             multiple colors
            
Palestrante: Yury Person
             Goethe-Universität

Hora e Data: 15h30m, sexta-feira, 28 de março de 2014

Local:       Sala Multi-usos do Numec

Resumo:

A graph G is called H-Ramsey if no matter how one colors its
edges red/blue, there is a  monochromatic copy of H.  We say
that G is  minimal H-Ramsey if G is  H-Ramsey, but no proper
graph  of it  is.  Burr,  Erdös and  Lovász  studied minimum
degree among  all minimal K_t-Ramsey graphs  and showed that
it  equals  (t-1)^2.  We  discuss  generalizations of  their
result to more colors.

Joint work with Jacob Fox, Andrey Grinshpun, Anita Liebenau 
and Tibor Szabó.