Binary Supersolvable Matroids and Modular Constructions
From MaRDI portal
Publication:3982141
DOI10.2307/2048620zbMath0760.05022OpenAlexW4256013775MaRDI QIDQ3982141
Publication date: 26 June 1992
Full work available at URL: https://doi.org/10.2307/2048620
Combinatorial aspects of matroids and geometric lattices (05B35) Semimodular lattices, geometric lattices (06C10)
Related Items
Chordal matroids arising from generalized parallel connections, Modular construction of free hyperplane arrangements, T-uniqueness of some families of \(k\)-chordal matroids, How is a chordal graph like a supersolvable binary matroid?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On linear systems with integral valued solutions
- On rigid circuit graphs
- On the cycle polytope of a binary matroid
- Line-closed combinatorial geometries
- Decomposition of regular matroids
- Broken circuit complexes: Factorizations and generalizations
- On strong joins and pushout of combinatorial geometries
- Modular elements of geometric lattices
- Supersolvable lattices
- Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries
- Modular Constructions for Combinatorial Geometries
- The Broken-Circuit Complex
- Higher Order Independence in Matroids
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- Theory of Matroids