A graph-theoretical axiomatization of oriented matroids
We characterize which systems of sign vectors are the cocircuits of an oriented matroid in terms of the cocircuit graph.
math.CO↗
arXiv subjects
Publications and source records attributed to Juan Jose Montellano-Ballesteros.
We characterize which systems of sign vectors are the cocircuits of an oriented matroid in terms of the cocircuit graph.
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid. This improves an algorithm proposed by Babson, Finschi and Fukuda. Moreover we strengthen a result of Montellano-Ballesteros and Strausz about crabbed connectivity of cocircuit graphs of uniform oriented matroids.