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

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

Título:      The Kelmans-Seymour Conjecture
            
Palestrante: Oliver Cooley
             Technische Universität München

Hora e Data: 14h, sexta-feira, 07 de outubro de 2011

Local:       auditório do NUMEC

Resumo: 

The famous  theorem of  Kuratowski states that  a non-planar
graph contains a subdivision  of either K_5 or K_{3,3}. This
leads to the  question of when one can  guarantee our choice
of  one  of  these  two substructures.  The  Kelmans-Seymour
Conjecture  states  that  if  a  non-planar  graph  is  also
5-connected, then it contains  a subdivision of K_5. In this
talk I  will introduce the conjecture,  some partial results
towards it  and our first  steps in attempting  extend these
results. This is based on joint work with Christoph Koch and
Anusch Taraz.