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

============================================================

Titulo:      Large planar subgraphs and rapidly growing numbers 
             of edges
            
Palestrante: Andreas Würfl
             Technische Universität München

Hora e Data: 14h00, sexta-feira, 12 de março de 2010

Local:       auditório do NUMEC

Resumo:

Let  pl(n,d) denote  the maximum  number m  such  that every
graph G on  n vertices with the minimum  degree d contains a
planar subgraph of m edges.  We shall study the behaviour of
pl(n,d) near  d=n/2. At this point we  observe rapid change:
while pl(n,n/2)=2n we believe that pl(n,n/2+1) =2.5 n.