• Unavoidable Minors of Large 2- and 3-Connected Matroids 

      Oxley, James (Georgia Institute of Technology, 2012-05)
      It is well known that every sufficiently large 2-connected loopless graph has a big cycle or a big bond. Twenty years ago, at the Seattle Graph Minors Conference, Robin Thomas asked whether the analogous result is true for ...