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

   Tarde de Combinatória Extrema e Métodos Probabilísticos
============================================================

Título:      Families of hypergraphs with many restricted 
             edge colorings
            
Palestrante: Hanno Lefmann
             Technische Universität Chemnitz

Hora e Data: 14h, sexta-feira, 17 de fevereiro de 2012

Local:       Sala Multi-usos do Numec

Resumo: 

Let F be  a given r-uniform hypergraph and let  k be a fixed
positive integer.  For a (large) r-uniform host hypergraph H
on n vertices, we consider the number of edge colorings of H
with k colors  such that no monochromatic copy  of F occurs.
There arises the natural  question as to which hypergraphs H
on n  vertices allow the  largest number of  such colorings.
It  turns   out  that  this  question  is   related  to  the
corresponding Turán  type problem, at  least for k=2  or k=3
colors.   In this  talk, the  forbidden hypergraphs  F under
consideration   are   Fan-hypergraphs,   expanded   complete
2-graphs, and generalized triangles.