Diameters of cocircuit graphs of oriented matroids: an update

DOI10.37236/9653zbMath1486.52057arXiv2006.08922OpenAlexW3035698984MaRDI QIDQ2121728

Zhenyang Zhang, Steven Klee, Ilan Adler, Jesús A. De Loera

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.08922

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Distance in graphs (05C12) Oriented matroids in discrete geometry (52C40) Combinatorial complexity of geometric structures (52C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recent progress on the combinatorial diameter of polytopes and simplicial complexes
• A counterexample to the Hirsch conjecture
• Cubic time recognition of cocircuit graphs of uniform oriented matroids
• Oriented matroids and combinatorial manifolds
• Oriented matroids
• Generation of oriented matroids --- a graph theoretical approach
• Criss-cross methods: A fresh view on pivot algorithms
• On the cocircuit graph of an oriented matroid
• Testing orientability for matroids is NP-complete
• An asymptotically improved upper bound on the diameter of polyhedra
• A characterization of cocircuit graphs of uniform oriented matroids
• A graph-theoretical axiomatization of oriented matroids
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• Diameter of Polyhedra: Limits of Abstraction
• The d-Step Conjecture and Its Relatives
• A quasi-polynomial bound for the diameter\\of graphs of polyhedra
• Lectures on Polytopes
• Oriented Matroids
• The width of five-dimensional prismatoids
• The maximum diameter of pure simplicial complexes and pseudo-manifolds
• Cocircuit graphs and efficient orientation reconstruction in oriented matroids