[PAST EVENT] Mathematics Colloquium/CSUMS Lecture: Hehui Wu (McGill University, Canada)

September 23, 2011
2pm - 3pm
Jones Hall, Room 301
200 Ukrop Way
Williamsburg, VA 23185Map this location
The Chv\'atal--Erd\H{o}s Theorem states that every graph whose connectivity is at least its independence number has a spanning cycle. In 1976, Fouquet and Jolivet conjectured an extension: If $G$ is an $n$-vertex $k$-connected graph with independence number $a$, and $a \ge k$, then $G$ has a cycle of length at least $\frac{k(n+a-k)}{a}$. We prove this conjecture. This is a joint work with Suil O and Douglas B. West.