Publication details
Closure property of contraction-depth of matroids
| Authors | |
|---|---|
| Year of publication | 2025 |
| Type | Peer-reviewed scientific article |
| Magazine / Source | JOURNAL OF COMBINATORIAL THEORY SERIES B |
| MU Faculty or unit | |
| Citation | |
| web | https://doi.org/10.1016/j.jctb.2025.07.006 |
| Doi | https://doi.org/10.1016/j.jctb.2025.07.006 |
| Keywords | Matroid; Depth parameters; Contraction-depth |
| Description | Contraction & lowast;-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-depth of a graph G is the minimum height of a rooted forest whose closure contains G by proving the following for every matroid M (except the trivial case when M consists of loops and coloops only): the contraction & lowast;-depth of M plus one is equal to the minimum contraction-depth of a matroid containing M as a restriction. (c) 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies. |