 |
 |
|
Evènement pour le groupe GT Graphes et Applications
| Date | 2010-05-28 14:00-15:00 |
| Titre | The 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. |
| Lieu | Salle 178 |
| Orateur | Tomas Kaiser |
| Url | Department of Mathematics, Plzeň University, Czech Republic |
Aucun document lié à cet événement. RetourRetour à l'index
| |