10:30 AM-12:30 PM
Room: Sidney Smith 2135
This minisymposium will focus on the proof technique known as the Discharging Method. Famous for its use in the solution of the Four Color Theorem, this method has now been successfully used in a wide variety of applications. Classes of graphs with low average degree, including all minor closed classes of graphs (e.g. partial k-trees, graphs on surfaces) arise in many applications. Those who encounter such classes of graphs should have the Discharging Method in their bag of tricks, especially since it yields practical polytime algorithms.
Organizer: Daniel P. Sanders