Evènement pour le groupe GT Graphes et Applications

Date 2010-05-28  14:00-15:00
TitreThe doubly-critical graph conjecture 
RésuméA graph is said to be doubly-critical if the removal of any two adjacent vertices causes the chromatic number to drop by two. A special case of a long-standing conjecture of Erdos and Lovasz asserts that the only connected doubly-critical graphs are the complete graphs. In this talk, I will survey the known results and discuss some questions related to this conjecture.  
LieuSalle 178 
OrateurTomas Kaiser 
UrlDepartment of Mathematics, Plzeň University, Czech Republic 

Aucun document lié à cet événement.

Retour à l'index