Graphs and Matroids - Jim Geelen-Keeping connectivity under taking minors

Abstract: Suppose that you are given an ordering of the elements of a $k$-connected matroid, and you want to remove the elements one at a time, in the given order, keeping the intermediate matroids as highly connected as possible. How much connectivity can you keep?