| Alon-Sack-Seymour Conjecture|
du groupe GT Graphes et Applications
|Date|| 2010-03-05 14:00-15:00|
|Titre|| Alon-Sack-Seymour Conjecture |
|Résumé||Finding a combinatorial proof for Graham-Pollak theorem have been a challenge for over 30 years. Though no such proof been found yet, such attempts have been fruitful in other ways. Some strengthening and extensions have been proved or conjectured.
In this regard Alon Sack and Seymour conjectured that if the edge set of a graph G could be partitioned into n complete bipartite graphs then the chromatic number of G is at most n+1.
In this talk we present a homomorphism approach to this conjecture. While we prove it for small values of n we expect the conjecture to fail for large values. We introduce some suspect toward this end. |
|Lieu||Salle 178 |
|Orateur||Resa Naserasr |
Aucun document lié à cet événement.RetourRetour à l'index