A characterization of uniform matroids

DOI10.5402/2011/208478MaRDI QIDQ415778zbMATH OpenOpenAlexWikidataFDO

Authors Brahim Chaourar

Publication date 9 May 2012

Published in ISRN Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5402/2011/208478

zbMATH Keywords

bases polytopelocked subsets

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

Summary: This paper gives a characterization of uniform matroids by means of locked subsets. Locked subsets are 2-connected subsets, their complements are 2-connected in the dual, and the minimum rank of both is 2. Locked subsets give the nontrivial facets of the bases polytope.

Recommendations

• scientific article; zbMATH DE number 1439690
• A generalisation of uniform matroids
• A note on the non-spanning circuits of a matroid
• scientific article; zbMATH DE number 4023304
• A characterization of connected matroids

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• On greedy bases packing in matroids
• On the \(K\)th best base of a matroid

Cited in

(5)

• The facets of the spanning trees polytope
• A unique factorization theorem for matroids
• scientific article; zbMATH DE number 1439690 (Why is no real title available?)
• A short proof of a min-max relation for the bases packing of a matroid
• Subdivisions of integral base polytopes

This page was built for publication: A characterization of uniform matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415778)