Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a minor of another. By contrast, it is well known that the class of all matroids does contains such infinite antichains. However, for many classes of matroids, even the class of binary matroids, it is not known whether or not the class contains an infinite antichain. In this paper, we examine a class of matroids of relatively simple structure: \({\mathcal M}_{a,b,c}\) consists of those matroids for which the deletion of some set of at most \(a\) elements and the contraction of some set of at most \(b\) elements results in a matroid in which every component has at most \(c\) elements. We determine precisely when \({\mathcal M}_{a,b,c}\) contains an infinite antichain. We also show that, among the matroids representable over a finite fixed field, there is no infinite antichain in a fixed \({\mathcal M}_{a,b,c}\); nor is there an infinite antichain when the circuit size is bounded.
- Some characterization of infinite antimatroids
- Infinite antichains of matroids with characteristic set \(\{ p\}\)
- scientific article; zbMATH DE number 67321
- Infinite matroids in graphs
- On the intersection of infinite matroids
- On antimatroids of infinite character
- A Cantor-Bernstein theorem for infinite matroids
- Poset properties of infinite antimatroids
- Axioms for infinite matroids
- A matroid related to finitely chainlike, countably infinite networks
- The forbidden minor characterization of line-search antimatroids of rooted digraphs
- Largest circuits in matroids
- Branch-width and well-quasi-ordering in matroids and graphs.
- Branch-depth: generalizing tree-depth of graphs
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Pairs of largest circuits in 3-connected matroids
- Some characterization of infinite antimatroids
- On chains of matroids in the weak order
- On antimatroids of infinite character
- Infinite antichains of matroids with characteristic set \(\{ p\}\)
- Large simple d-cycles in simplicial complexes
- Pathwidth vs Cocircumference
- A nearly finitary matroid that is not \(k\)-nearly finitary
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- When excluding one matroid prevents infinite antichains
This page was built for publication: On infinite antichains of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892829)
