加载中…
Contraction-depth is considered to be one of the analogues of graph tree-depth in the matroid setting. In this paper, we investigate structural properties of contraction-depth of matroids representable over finite fields and rationals. In particular, we prove that the obstructions for contraction-depth for these classes of matroids are bounded in size. From this we derive analogous results for related notions of contraction-depth and deletion-depth. Moreover, we define a dual notion to contraction-depth, named deletion-depth, for -representable matroids, and by duality extend our results from contraction-depth to this notion.

生成讲解博客的中文版本

生成AI智能校验的中文版本