A characterization of cocircuit graphs of uniform oriented matroids
Given an oriented matroid \({\mathcal M}\), the authors define the cocircuit graph as the 1-skeleton of the cellular decomposition of the sphere induced by the pseudospheres that realizes \({\mathcal M}\) via the well-known topological representation theorem of Folkman and Lawrence. In this paper, it is presented a complete characterization of such graphs in the case when \({\mathcal M}\) is uniform. This characterization is given in terms of embeddings into the 1-skeleton of the \(n\)-cube's \(k\)-skeleton's dual complex where \(n\) denotes the number of elements of \({\mathcal M}\).
- Antipodal graphs and oriented matroids
- Cocircuit graphs and efficient orientation reconstruction in oriented matroids
- Counting polytopes via the Radon complex
- Generation of oriented matroids --- a graph theoretical approach
- scientific article; zbMATH DE number 53152 (Why is no real title available?)
- Oriented matroids
- Generation of oriented matroids --- a graph theoretical approach
- On the cocircuit graph of an oriented matroid
- Counting polytopes via the Radon complex
- Diameters of cocircuit graphs of oriented matroids: an update
- A graph-theoretical axiomatization of oriented matroids
- Polynomial time recognition of uniform cocircuit graphs
- A graph-theoretical axiomatization of oriented matroids
- Cocircuit graphs and efficient orientation reconstruction in oriented matroids
- Cubic time recognition of cocircuit graphs of uniform oriented matroids
- Corners and simpliciality in oriented matroids and partial cubes
This page was built for publication: A characterization of cocircuit graphs of uniform oriented matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496197)
