On the impossibility of decomposing binary matroids

DOI10.1016/J.ORL.2022.09.003MaRDI QIDQ2084049zbMATH OpenOpenAlexFDO

Authors Marilena Leichter, Benjamin Moseley, Kirk Pruhs

Publication date 17 October 2022

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2206.12896

zbMATH Keywords

matroid intersectionmatroidmatroid coloringmatroid decomposition

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• On partitioning two matroids into common independent subsets
• Rainbow and monochromatic circuits and cocircuits in binary matroids
• A decomposition theory for matroids. I: General results
• Circuit decompositions of binary matroids
• Decomposition of binary matroids

Cites work

• scientific article; zbMATH DE number 7740917 (Why is no real title available?)
• Complexity of packing common bases in matroids
• List coloring of two matroids through reduction to partition matroids
• Minimum partition of a matroid into independent subsets
• The intersection of a matroid and a simplicial complex
• The matroid intersection cover problem

Cited in

(3)

• Partitioning into common independent sets via relaxing strongly base orderability
• On the Impossibility of Decomposing Binary Matroids
• An Obstacle to a Decomposition Theorem for Near-Regular Matroids

This page was built for publication: On the impossibility of decomposing binary matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084049)