On the impossibility of decomposing binary matroids

DOI10.1016/j.orl.2022.09.003OpenAlexW4295958841MaRDI QIDQ2084049

Benjamin Moseley, Marilena Leichter, Kirk R. 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

matroidmatroid intersectionmatroid coloringmatroid decomposition

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Partitioning into common independent sets via relaxing strongly base orderability

Cites Work

• Unnamed Item
• Complexity of packing common bases in matroids
• The matroid intersection cover problem
• The intersection of a matroid and a simplicial complex
• List Coloring of Two Matroids through Reduction to Partition Matroids
• Minimum partition of a matroid into independent subsets

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