The positive circuits of oriented matroids with the packing property or idealness

DOI10.1016/J.ENDM.2010.05.037MaRDI QIDQ2883575zbMATH OpenOpenAlexFDO

Authors Kenji Kashiwabara, Tadashi Sakuma

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.037

zbMATH Keywords

oriented matroidclutterpacking propertyidealnesspositive circuit

Mathematics Subject Classification ID

Oriented matroids in discrete geometry (52C40) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• scientific article; zbMATH DE number 1187138
• Clutters and circuits. III
• On ideal minimally non-packing clutters
• The packing property.
• Packing circuits in matroids

Cites work

• scientific article; zbMATH DE number 1762085 (Why is no real title available?)
• A Minimax Theorem for Directed Graphs
• A counterexample to a conjecture of Edmonds and Giles
• Combinatorial optimization. Packing and covering
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On dijoins
• Oriented Matroids
• The matroids with the max-flow min-cut property
• The max-flow min-cut property of two-dimensional affine convex geometries
• The packing property.

This page was built for publication: The positive circuits of oriented matroids with the packing property or idealness

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