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

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

Título:      Perfect matchings and packings in hypergraphs
            
Palestrante: Richard Mycroft
             University of Birmingham

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

Local:       auditório do NUMEC

Resumo:

It  is easy  to prove  that any  graph on  $n$  vertics with
minimum degree  at least $n/2$ contains  a perfect matching,
provided $n$ is even.   Furthermore, Tutte's theorem gives a
simple characterisation  of all graphs  containing a perfect
matching.  However, for  $k$-graphs,  where $k  \geq 3$,  we
expect that there is  no such characterisation, and even the
problem of what minimum degree guarantees a perfect matching
is  very  difficult (for  various  notions  of  degree in  a
$k$-graph). In this talk I  will discuss this problem in the
setting of a $k$-complex, which will lead to the solution of
some packing problems in graphs and hypergraphs