Monday, April 6, 2026 2:45 pm
-
3:45 pm
EDT (GMT -04:00)
| Speaker: | Eileen Robinson |
| Affiliation: | Université libre de Bruxelles |
| Room: | MC 5479 |
Abstract:We define the codegree of a given graph as the maximum number of neighbors that any two distinct vertices have in common.
In 2002, V. Vu proposed that for a given graph, its chromatic number should never be too much larger than its codegree, provided that its codegree is not too small as a proportion of its maximum degree.