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

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

Título:      Quasi-randomness for graphs with general degree
             distributions

Palestrante: Hiêp Hàn 
             Humboldt-Universität zu Berlin 

Hora e Data: 15h??, sexta-feira, 13 de novembro de 2009

Local:       Auditório do NUMEC

Resumo:

Random graphs have many desirable properties such as uniform
edge    distribution    (small    discrepancy)    or    good
expansion.  Hence capturing  the notion  of randomness  in a
deterministic setting  is an important problem,  both from a
structural and  an algorithmic  point of view.  This problem
was  systematically  studied first  by  A.  Thomason in  the
mid-80's and today it is  fairly well understood in the case
of  dense  graphs.  In  this  talk we  review  some  of  the
classical results in this area for dense graphs and focus on
recent results for graphs with general degree distributions.