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

DOI10.1016/J.AAM.2023.102577MaRDI QIDQ6094849zbMATH OpenOpenAlexWikidataFDO

Authors Cameron Crenshaw, James Oxley

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)

Abstract: Let $G$ be a graph such that, whenever two vertices $x$ and $y$ of $G$ are joined by three internally disjoint paths, $x$ and $y$ are adjacent. Jamison and Mulder determined that the set of such graphs coincides with the set of graphs that can be built from cycles and complete graphs via 1-sums and parallel connections. This paper proves an analogous result for binary matroids.

Recommendations

• Adjacency in binary matroids
• The binary matroids whose only odd circuits are triangles
• Isotropic matroids. III: Connectivity
• Triples in matroid circuits
• On minor-minimally 3-connected binary matroids

Cites work

• Connected hyperplanes in binary matroids
• Decomposition of regular matroids
• Graphs constructible from cycles and complete graphs
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)

Cited in

(4)

• scientific article; zbMATH DE number 3920519 (Why is no real title available?)
• Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour
• Connectivity of single-element coextensions of a binary matroid
• Connected hyperplanes in binary matroids

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

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