In this paper we define oriented matroids and develop their fundamental properties, which lead to generalizations of known results concerning directed graphs, convex polytopes, and linear programming. Duals and minors of oriented matroids are defined. It is shown that every coordinatization (representation) of a matroid over an ordered field induces an orientation of the matroid. Examples of matroids that are orientable but not coordinatizable and of matroids that are not orientable are presented. We show that a binary matroid is orientable if and only if it is unimodular (regular), and that every unimodular matroid has an orientation that is induced by a coordinatization and is unique in a certain straightforward sense. © 1978.
Bland, R. G., & Las Vergnas, M. (1978). Orientability of matroids. Journal of Combinatorial Theory, Series B, 24(1), 94–123. https://doi.org/10.1016/0095-8956(78)90080-1