Color 6-critical graphs on surfaces

Color 6-critical graphs on surfaces

-
Robin Thomas, Georgia Institute of Technology
Fine Hall 224

We give a simple proof of a theorem of Thomassen that for every surface S there are only finitely many 6-critical graphs that embed in S. With a little bit of additional effort we can bound the number of vertices of a 6-critical graph embedded in S by a function that is linear in the genus of S. This is joint work with Luke Postle.