Small cocircuits in minimally vertically $4$-connected matroids
James Oxley, Zach Walsh

TL;DR
The paper proves that minimally vertically 4-connected matroids with at least six elements generally contain small cocircuits, extending known results for lower connectivity levels and identifying specific exceptions.
Contribution
It establishes the existence of small cocircuits in minimally vertically 4-connected matroids, including binary cases, with a notable exception of a particular non-binary matroid.
Findings
Every minimally vertically 4-connected matroid with ≥6 elements has a 4-element cocircuit.
Such matroids also have a 5-element cocircuit containing a triangle, except for one non-binary case.
Binary cases always have a 4-element cocircuit.
Abstract
Halin proved that every minimally -connected graph has a vertex of degree . More generally, does every minimally vertically -connected matroid have a -element cocircuit? Results of Murty and Wong give an affirmative answer when . We show that every minimally vertically -connected matroid with at least six elements has a -element cocircuit, or a -element cocircuit that contains a triangle, with the exception of a specific non-binary -element matroid. Consequently, every minimally vertically -connected binary matroid with at least six elements has a -element cocircuit.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs
