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

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

Título:      The complete intersection problem for permutations
            
Palestrante: Vladimir Blinovsky
             Institute of Information Transmission Problems
             Russian Academy of Sciences, Moscow

Hora e Data: 14h, sexta-feira, 04 de fevereiro de 2011

Local:       auditório do NUMEC

Resumo:

Two permutations of a finite set $t$-intersect if they have
$t$ common cycles.  We find the maximal cardinality of a set
of permutations of a given finite set, such that any two
permutations from this set is $t-$intersecting.

This work complete previous investigations of other authors
where they find this cardinality with different restrictions
on $t$.