A Note on the Connectivity of Binary Matroids
Subscription Access
DOI:
https://doi.org/10.5890/DNC.2022.09.004Abstract
In [J. Combinatorial Theory, Ser. B, 28 (1980), 305-359], Seymour introduced the binary matroid 3-sums and proved that if a 3-connected binary matroid $M$ is a 3-sum of matroids $M_1$ and $M_2$, then each of $M_1$ and $M_2$ is isomorphic to a proper minor of $M$. For a 3-connected binary matroid $M$ expressed as a 3-sum of $M_1$ and $M_2$, we show that in general, both $M_1$ and $M_2$ are 2-connected, and if $M_1$ and $M_2$ are simple matroids, then both $M_1$ and $M_2$ are also 3-connected.References
[1] Oxley, J.G. (2011), Matroid theory, Oxford university Press, New York.
[2] Seymour, P.D. (1980), Decomposition of regular matroids, J. Combin. Theory, Ser. B, 28 305-359.
[3] Seymour, P.D. (1981), Matroids and multicommodity flows, European J. Combin. Theory Ser. B., 2 257-290. %
[4] Bondy, J.A. and Murty, U.S.R. (2008), Graph Theory, Springer.
Article Metrics
Citations
3 Crossref
PublishedSeptember 2022
Usage tracking begins September 1, 2026.
History
Published
Issue
Section
Research Articles
License
Unless an article landing page states a Creative Commons or other article-specific license, the article is published by L&H Scientific Publishing, LLC and all rights are reserved. The article-level license and copyright notice govern access and reuse.How to Cite
Yin, J., Huo, B., & Lai, H.-J. (2026). A Note on the Connectivity of Binary Matroids. Discontinuity, Nonlinearity, and Complexity, 11(3), 405-408. https://doi.org/10.5890/DNC.2022.09.004