Recommendations
- 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
Cited in
(15)- Infinite antichains of matroids with characteristic set \(\{ p\}\)
- When excluding one matroid prevents infinite antichains
- Some characterization of infinite antimatroids
- On antimatroids of infinite character
- Branch-width and well-quasi-ordering in matroids and graphs.
- The forbidden minor characterization of line-search antimatroids of rooted digraphs
- Branch-depth: generalizing tree-depth of graphs
- Large simple \(d\)-cycles in simplicial complexes
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Pathwidth vs Cocircumference
- A nearly finitary matroid that is not \(k\)-nearly finitary
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Pairs of largest circuits in 3-connected matroids
- On chains of matroids in the weak order
- Largest circuits in matroids
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)
