Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) Algo
Finite obstructions to graph partitions
Pavol Hell

13 April 2012, 14h30 - 13 April 2012, 15h30
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche :

Résumé :
Consider graph partitions with possible restrictions on the parts, and on
the connections between parts: the restrictions can be that there are no
edges, or that all possible edges are present. Many partitions arising in
the study of perfect graphs have this flavour. In some cases the existence
of such a partition is characterized by the absence of finitely many
forbidden induced subgraphs. We ask when this is the case, and give some
general answers, and some answers for special graph classes, such as
chordal graphs. These include joint results with T. Feder, S. Nekooei Rizi,
W. Xie, O. Shklarsky, and others. For those who will have attended my talk
at LIAFA, I will add some new topics.

Pour en savoir plus : http://www.cs.sfu.ca/~pavol/
Séminaires
Resilient PDE solving approaches for exascale comp
Calcul à haute performance
Tuesday 29 May 2018 - 10h30
Salle : 465 - PCRI-N
Paul Mycek .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 25 May 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

TBA
Algorithmique distribuée
Wednesday 02 May 2018 - 10h30
Salle : 465 - PCRI-N
Evangelos Bampas .............................................

Mariage stable auto-stabilisant et distribué
Théorie des graphes
Friday 13 April 2018 - 14h30
Salle : 445 - PCRI-N
Marie Laveau .............................................

Modélisation et implémentation du produit de matri
Calcul à haute performance
Wednesday 11 April 2018 - 10h30
Salle : 465 - PCRI-N
Thomas Lambert .............................................