Even circuits in oriented matroids
DOI10.5070/C62156875zbMath1498.05047arXiv2010.08988OpenAlexW4220755252MaRDI QIDQ5052170
Raphael Steiner, Sebastian Wiederrecht, Karl Heuer
Publication date: 21 November 2022
Published in: Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.08988
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Oriented matroids in discrete geometry (52C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing directed circuits exactly
- Signsolvability revisited
- Sign-nonsingular matrices and even cycles in directed graphs
- Characterization of even directed graphs
- An application of simultaneous diophantine approximation in combinatorial optimization
- Decomposition of regular matroids
- Pólya's permanent problem
- Directed tree-width
- Permanents, Pfaffian orientations, and even directed circuits
- Graph Theory
- The Directed Grid Theorem
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- On digraphs with the odd cycle property
- Converting Linear Programs to Network Problems
- Algorithmic versus axiomatic definitions of matroids
- Khachiyan’s algorithm for linear programming
- Oriented Matroids
- Digraphs
This page was built for publication: Even circuits in oriented matroids
