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.











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)