The positive circuits of oriented matroids with the packing property or idealness
From MaRDI portal
Publication:2883575
DOI10.1016/J.ENDM.2010.05.037zbMATH Open1237.52019OpenAlexW2050301068MaRDI QIDQ2883575FDOQ2883575
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
Recommendations
Oriented matroids in discrete geometry (52C40) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Oriented Matroids
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A counterexample to a conjecture of Edmonds and Giles
- A Minimax Theorem for Directed Graphs
- On dijoins
- The matroids with the max-flow min-cut property
- Combinatorial optimization. Packing and covering
- The packing property.
- The max-flow min-cut property of two-dimensional affine convex geometries
- Title not available (Why is that?)
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)