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

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

Título:      A theorem of Erdös, Lovász and Spencer on subgraph
             densities in a given graph
            
Palestrante: Carlos Hoppen
             Instituto de Matemática
             Universidade Federal do Rio Grande do Sul

Hora e Data: 14h, sexta-feira, 01 de março de 2013

Local:       Sala Multi-usos do Numec

Resumo:

I shall present a classical  result due to Erdös, Lovász and
Spencer [Strong  independence of graphcopy  functions, Graph
Theory and Related Topics, Academic Press (1979), 165--172],
which states that densities of (induced) connected subgraphs
are  independent  in  a  strong sense.   Moreover,  I  shall
discuss how a similar  result may be proved for permutations
and  some consequences to  finite forcibility  and parameter
testing for permutations will be mentioned.