Some extremal connectivity results for matroids
From MaRDI portal
Publication:1262315
DOI10.1016/0095-8956(91)90070-ZzbMath0686.05011OpenAlexW2088907071MaRDI QIDQ1262315
Publication date: 1991
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(91)90070-z
Related Items (5)
Some Local Extremal Connectivity Results for Matroids ⋮ A minimal 3-connectedness result for matroids ⋮ On the structure of 3-connected matroids and graphs ⋮ On extremal connectivity properties of unavoidable matroids ⋮ Matroid packing and covering with circuits through an element
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some extremal connectivity results for graphs and matroids
- On linear systems with integral valued solutions
- On minor-minimally-connected matroids
- A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
- Decomposition of regular matroids
- Matroid representation over GF(3)
- A minimal 3-connectedness result for matroids
- Balanced sets and circuits in a transversal space
- Designs and circuit bases
- Theorems on matroid connectivity
- Extremal critically connected matroids
- Sylvester's problem of the 15 schoolgirls
- Matroids with Sylvester property
- Extremal Results and Configuration Theorems for Steiner Systems
- On Connectivity in Matroids and Graphs
- On Crapo's Beta Invariant for Matroids
- The Bracket Ring of a Combinatorial Geometry. II: Unimodular Geometries
- Connectivity in Matroids
- A Theorem on Steiner Systems
- A Combinatorial Model for Series-Parallel Networks
- On one-factorizations of complete graphs
- Matroid designs
This page was built for publication: Some extremal connectivity results for matroids
