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

Cameron Crenshaw, James Oxley

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 t…