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

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

Título:      Counting relative to pseudorandom graphs
            
Palestrante: Peter Allen
             London School of Economics and Political Science

Hora e Data: 14h, sexta-feira, 05 de abril de 2013

Local:       Sala Multi-usos do Numec

Resumo:

There  has recently  been substantial  interest  in extremal
results 'relative to' sparse graphs. In this talk I will say
what a  'pseudorandom' graph is,  explain how one  can count
copies of a  fixed (small) graph F in  a pseudorandom graph,
and finally  explain what it  means to work 'relative  to' a
pseudorandom graph, and how we can do so.