============================================================ 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�.