On binary reducibility
From MaRDI portal
Lovász and the reviewer proved that a connected graphic matroid M is the sum of two matroids of rank at least one if and only if M-e is disconnected for at least one element e. Cunningham generalized this for binary maroids. The present author gives a shorter proof for the general result, using geometric ideas of Mason and a theorem of Lucas on rank preserving weak maps.
Recommendations
Cites work
- BINARY MATROID SUMS
- Chords and disjoint paths in matroids
- scientific article; zbMATH DE number 3472074 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3557809 (Why is no real title available?)
- scientific article; zbMATH DE number 3342868 (Why is no real title available?)
- On the sum of matroids
- Weak Maps of Combinatorial Geometries
Cited in
(7)- Decomposition of binary matroids
- Rainbow and monochromatic circuits and cocircuits in binary matroids
- Matroid union -- graphic? binary? neither?
- scientific article; zbMATH DE number 3863214 (Why is no real title available?)
- scientific article; zbMATH DE number 5596976 (Why is no real title available?)
- Characterizations of Disconnected Matroids
- On Reducibility in Bilevel Problems
This page was built for publication: On binary reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109039)