Small cocircuits in minimally vertically $4$-connected matroids
Combinatorics
2022-05-27 v2
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.
Keywords
Cite
@article{arxiv.2110.13120,
title = {Small cocircuits in minimally vertically $4$-connected matroids},
author = {James Oxley and Zach Walsh},
journal= {arXiv preprint arXiv:2110.13120},
year = {2022}
}
Comments
There was an error in the proof of Theorem 1.4. We removed the proof, and replaced Theorem 1.4 with Conjecture 1.6