A splitter theorem for connected clutters

MaRDI QIDQ6283837zbMATH OpenFDO

Authors Amanda Cameron, Dillon Mayhew

Publication date 2 March 2017

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for clutters that generalises that of connectivity for matroids. We prove a splitter theorem for connected clutters that has the splitter theorem for connected matroids as a special case: if $M$ and $N$ are connected clutters, and $N$ is a proper minor of $M$, then there is an element in $E(M)$ that can be deleted or contracted to produce a connected clutter with $N$ as a minor.

This page was built for publication: A splitter theorem for connected clutters

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