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

  Tarde de Combinatória Extrema e  Métodos Probabilísticos 
============================================================

Título:      Extremal problems for random discrete structures

Palestrante: Mathias Schacht 
             Universität Hamburg 

Hora e Data: 14h00, sexta-feira, 13 de novembro de 2009

Local:       Auditório do NUMEC

Resumo:

We  study  thresholds  for  extremal  properties  of  random
discrete  structures.    We  determine  the   threshold  for
Szemerédi's  theorem on  arithmetic  progressions in  random
subsets of the  integers and its multidimensional extensions
and we  determine the threshold for  Turán-type problems for
random graphs  and hypergraphs.  In particular,  we verify a
conjecture  of Kohayakawa, Luczak,  and Rödl  for Turán-type
problems in random graphs.  Similar results were obtained by
Conlon and Gowers