List coloring of matroids

Our paper titled List colouring of two matroids through reduction to partition matroids has been accepted for publication in SIAM Journal on Discrete Mathematics! The paper focuses on the question whether the list coloring number of the intersection of two matroids can be bounded by a constant times the coloring number. We consider matroid classes…

Why matroids?

Anyone who has worked with matroids has come away with the conviction that matroids are one of the richest and most useful ideas of our day. – Gian Carlo Rota