Small cocircuits in minimally vertically 4-connected matroids
Abstract
Halin proved that every minimally k-connected graph has a vertex of degree k. More generally, does every minimally vertically k-connected matroid have a k-element cocircuit? Results of Murty and Wong give an affirmative answer when k 3. We show that every minimally vertically 4-connected matroid with at least six elements has a 4-element cocircuit, or a 5-element cocircuit that contains a triangle, with the exception of a specific non-binary 9-element matroid. Consequently, every minimally vertically 4-connected binary matroid with at least six elements has a 4-element cocircuit.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.