Return to Colloquia & Seminar listing
Graph Homomorphisms
Special EventsSpeaker: | Eric Babson, University of Washington |
Location: | 1147 MSB |
Start time: | Mon, Feb 6 2006, 4:10PM |
Lovasz introduced topological techniques into graph theory in his clever computation of the chromatic numbers of Kneser graphs. This technique has developed in several directions. Maps between graphs have been enriched both to partially ordered sets (leading to a conjecture of Lovasz which I will discuss) and to sigma algebras. This leads to topological and measure theoretic methods respectively for bounding chromatic numbers (finding obstructions to maps between graphs) and for counting maps between graphs.