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
Some recent results on the integer linear programm
Théorie des graphes
Friday 30 November 2018 - 00h00
Salle : 445 - PCRI-N
Hung Nguyen .............................................

Maximum Independent Set in H-free graphs
Théorie des graphes
Friday 05 October 2018 - 14h30
Salle : 445 - PCRI-N
Edouard BONNET .............................................

A Family of Tractable Graph Distances
Gestion de données du Web
Wednesday 04 July 2018 - 10h30
Salle : 465 - PCRI-N
Stratis Ioannidis .............................................

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

Distributionally Robust Optimization with Principa
Optimisation combinatoire et stochastique
Friday 29 June 2018 - 11h00
Salle : 455 - PCRI-N
Dr. Jianqiang Cheng .............................................