Transformation and decomposition of clutters into matroids
DOI10.1016/J.AIM.2017.03.022zbMATH Open1361.05027OpenAlexW2604240996MaRDI QIDQ526353FDOQ526353
Jaume Martí-Farré, Anna de Mier
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
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07)
Cites Work
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Bottleneck extrema
- From clutters to matroids
- Symmetrization of closure operators and visibility
- Lower bounds for three algorithms for transversal hypergraph generation
- Clutters and semimatroids
- Clutters and matroids
- Clutters and circuits. II
- Completion and decomposition of a clutter into representable matroids
- Clutters and circuits. III
- Clutters and circuits
- Matroidizing set systems: A new approach to matroid theory
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
Recommendations
- From clutters to matroids 👍 👎
- Decomposition of binary matroids 👍 👎
- Clutters and semimatroids 👍 👎
- Clutters and matroids 👍 👎
- Completion and decomposition of a clutter into representable matroids 👍 👎
- Matroid representation of clique complexes 👍 👎
- Matroid Representation of Clique Complexes 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Transformation and decomposition of clutters into matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526353)
