arXiv Analytics

Sign in

arXiv:2409.13834 [math.CO]AbstractReferencesReviewsResources

Detachable pairs in $3$-connected matroids and simple $3$-connected graphs

Nick Brettell, Charles Semple, Gerry Toft

Published 2024-09-20Version 1

Let $M$ be a $3$-connected matroid. A pair $\{e,f\}$ in $M$ is detachable if $M \backslash e \backslash f$ or $M / e / f$ is $3$-connected. Williams (2015) proved that if $M$ has at least 13 elements, then at least one of the following holds: $M$ has a detachable pair, $M$ has a $3$-element circuit or cocircuit, or $M$ is a spike. We address the case where $M$ has a $3$-element circuit or cocircuit, to obtain a characterisation of when a matroid with at least 13 elements has a detachable pair. As a consequence, we characterise when a simple $3$-connected graph $G$ with $|E(G)| \ge 13$ has a pair of edges $\{e,f\}$ such that $G/e/f$ or $G \backslash e\backslash f$ is simple and $3$-connected.

Related articles: Most relevant | Search more
arXiv:1310.5779 [math.CO] (Published 2013-10-22, updated 2014-03-01)
A Characterisation of Weak Integer Additive Set-Indexers of Graphs
arXiv:math/0110211 [math.CO] (Published 2001-10-19)
Characterisation of lattices induced by (extended) Chip Firing Games
arXiv:1505.04986 [math.CO] (Published 2015-05-19)
On (strong) proper vertex-connection of graphs