Algebraic and Topological Combinatorics

Special Session at the Spring Eastern Section Meeting
of the American Mathematical Society

Courant Institute, New York, NY
April 12-13, 2003



Eric Babson
(University of Washington)


Maps and graph colorings


Abstract: We consider a topological lower bound on the chromatic number of a graph based on the topological connectivity of the space of maps from an odd length cycle into the graph. This idea was used by Lovasz in his proof of the Kneser conjecture with an edge taking the place of an odd cycle.

This is joint work with Dmitry Kozlov.

Back to the mainpage.
last updated: April 3, 2003