Degeneracy: From Graphs to Matroids

Allan Bickle, James Dylan Douthitt, Wayne Ge +1

A graph is $k$-degenerate if every subgraph has a vertex of degree at most $k$. We extend this notion to matroids, defining a loopless matroid $M$ to be $k$-degenerate if every res…