Transformation and decomposition of clutters into matroids

DOI10.1016/j.aim.2017.03.022zbMath1361.05027OpenAlexW2604240996MaRDI QIDQ526353

Anna de Mier, Jaume Martí-Farré

Publication date: 10 May 2017

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/112728

zbMATH Keywords

posetdecompositionmatroidclutter

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Approximation and decomposition in lattices of clutters ⋮ Uniform clutters and dominating sets of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• From clutters to matroids
• Clutters and circuits
• Symmetrization of closure operators and visibility
• Matroidizing set systems: A new approach to matroid theory
• Lower bounds for three algorithms for transversal hypergraph generation
• Clutters and semimatroids
• Clutters and matroids
• Clutters and circuits. II
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Completion and decomposition of a clutter into representable matroids
• Clutters and circuits. III
• Bottleneck extrema

This page was built for publication: Transformation and decomposition of clutters into matroids