1 paper · 1 filter
Marcin Brianski, Daniel Kral, Ander Lamaison
Contraction∗-depth is a matroid depth parameter analogous to tree-depth of graphs. We establish the matroid analogue of the classical graph theory result asserting that the tree…