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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.