Abstract: For a matroid , an element such that both and are regular is called a regular element of . We determine completely the structure of non-regular matroids with at least two regular elements. Besides four small size matroids, all 3-connected matroids in the class can be pieced together from or and a regular matroid using 3-sums. This result takes a step toward solving a problem posed by Paul Seymour: Find all 3-connected non-regular matroids with at least one regular element [5, 14.8.8].
Recommendations
Cites work
- A generalization of a graph result of D. W. Hall
- Almost-graphic matroids
- Binary matroids without prisms, prism duals, and cubes
- Decomposition of regular matroids
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- On internally 4-connected non-regular binary matroids
- On Nonbinary 3-Connected Matroids
Cited in
(7)- A decomposition theory for matroids. VI: Almost regular matroids
- Quasiregular matroids
- On maximum-sized k-regular matroids
- scientific article; zbMATH DE number 3867357 (Why is no real title available?)
- scientific article; zbMATH DE number 3871386 (Why is no real title available?)
- scientific article; zbMATH DE number 3970768 (Why is no real title available?)
- scientific article; zbMATH DE number 4029585 (Why is no real title available?)
This page was built for publication: Matroids with at least two regular elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427790)