加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本