From Clutters to Matroids

Electronic Journal Of Combinatorics

Jaume Martí-Farré¹ 

关键词: Clutter;    Hypergraph;    Matroid;    Circuits.;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

This paper deals with the question of completing a monotone increasing family of subsets $\Gamma$ of a finite set $\Omega$ to obtain the dependent sets of a matroid. Specifically, we provide several natural processes for transforming the clutter $\Lambda$

【 授权许可】

Others