A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder

DOI10.1016/j.aam.2023.102577arXiv2306.07386OpenAlexW4383163550WikidataQ123134945 ScholiaQ123134945MaRDI QIDQ6094849

James G. Oxley, Cameron Crenshaw

Publication date: 14 September 2023

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

binary matroidparallel connectiontheta-graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Cites Work

• Decomposition of regular matroids
• Graphs constructible from cycles and complete graphs
• Connected hyperplanes in binary matroids
• Unnamed Item

This page was built for publication: A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder