On infinite antichains of matroids
From MaRDI portal
Publication:1892829
DOI10.1006/JCTB.1995.1003zbMATH Open0820.05013OpenAlexW2126752065MaRDI QIDQ1892829FDOQ1892829
Bogdan Oporowski, Guoli Ding, James Oxley
Publication date: 2 July 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1003
Partial orders, general (06A06) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorics of partially ordered sets (06A07)
Cited In (10)
- When excluding one matroid prevents infinite antichains
- Branch-width and well-quasi-ordering in matroids and graphs.
- 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
- Pairs of largest circuits in 3-connected matroids
- On chains of matroids in the weak order
- Largest circuits in matroids
- Infinite antichains of matroids with characteristic set \(\{ p\}\)
Recommendations
- Title not available (Why is that?) 👍 👎
- Infinite antichains of matroids with characteristic set \(\{ p\}\) 👍 👎
- Title not available (Why is that?) 👍 👎
- Infinite matroids in graphs 👍 👎
- On the intersection of infinite matroids 👍 👎
- Title not available (Why is that?) 👍 👎
- A Cantor-Bernstein theorem for infinite matroids 👍 👎
- Title not available (Why is that?) 👍 👎
- Axioms for infinite matroids 👍 👎
- A matroid related to finitely chainlike, countably infinite networks 👍 👎
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)
