Speaker:  Brett Stevens (Carleton University)
Time and Place: 3 November 2006, 2:30pm, KED B004, University of Ottawa
Title: The Solution to the Shannon Switching Game
Abstract:

Shannon's switching game is a problem about the connectivity of a network under attack. One player deletes edges and the other makes some invulnerable attempting to connect two vertices before the other player destroys all possibility of connection. In a 1964 article that is now regarded as a classic, A. Lehman generalized the game to matroids and completely solved it. We present his solution. A. Lehman was awarded the Fulkerson prize for his work in discrete mathematics and died earlier this year.