Monday October 17th at 4.30pm

(1) Graphs closed under taking minors, i.e, graphs with no K_k minor.

(2) Graphs on a fixed surface.

In (1), we shall give an O(k)-factor approx. algorithm, and connect this result to the list-coloring version of Hadwiger's conjecture.

In (2), we shall consider 5-list-coloring on a fixed surface and 3-list-coloring with girth at least 5 on a fixed surface.

These results are joint work with B. Mohar and partially, C. Thomassen.