Pages that link to "Item:Q1892829"
From MaRDI portal
The following pages link to On infinite antichains of matroids (Q1892829):
Displaying 11 items.
- On chains of matroids in the weak order (Q491754) (← links)
- When excluding one matroid prevents infinite antichains (Q972858) (← links)
- The forbidden minor characterization of line-search antimatroids of rooted digraphs (Q1410699) (← links)
- Largest circuits in matroids (Q1775736) (← links)
- Branch-width and well-quasi-ordering in matroids and graphs. (Q1850591) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids (Q2384806) (← links)
- Pairs of largest circuits in 3-connected matroids (Q2459975) (← links)
- Large simple \(d\)-cycles in simplicial complexes (Q6074040) (← links)
- Pathwidth vs Cocircumference (Q6195950) (← links)
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming (Q6634533) (← links)