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

DOI10.1016/j.endm.2010.05.037zbMath1237.52019OpenAlexW2050301068MaRDI QIDQ2883575

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

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

Cites Work

• Unnamed Item
• A counterexample to a conjecture of Edmonds and Giles
• The matroids with the max-flow min-cut property
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The max-flow min-cut property of two-dimensional affine convex geometries
• Combinatorial Optimization
• A Minimax Theorem for Directed Graphs
• Oriented Matroids
• The packing property.
• On dijoins

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