# zbMATH — the first resource for mathematics

Orientability of matroids. (English) Zbl 0374.05016

##### MSC:
 05B35 Combinatorial aspects of matroids and geometric lattices
Full Text:
##### References:
 [1] Bland, R.G, Complementary orthogonal subspaces of $$R$$^{n} and orientability of matroids, () [2] Brylawski, T.H; Lucas, D, Uniquely representable combinatorial geometries, (1973), preprint · Zbl 0392.51007 [3] Camion, P, Matrices totalement unimodulaires et problèmes combinatoires, () · Zbl 0124.00901 [4] Camion, P, Modules unimodulaires, J. combinatorial theory, 4, 301-362, (1968) · Zbl 0174.29504 [5] Cheung, A; Crapo, H.H, A combinatorial perspective on algebraic geometry, Advances in math., 20, 388-414, (1976) · Zbl 0334.14001 [6] Crapo, H.H, A higher invariant for matroids, J. combinatorial theory, 2, 406-417, (1967) · Zbl 0168.26203 [7] Crapo, H.H; Rota, G.-C, () [8] Fulkerson, D.R, Networks, frames, blocking systems, (), 303-334 · Zbl 0182.53402 [9] Ingleton, A.W, Representation of matroids, (), 149-167 · Zbl 0222.05025 [10] Las Vergnas, M; Las Vergnas, M, Matroïdes orientables, C. R. acad. sci. Paris, 280, 61-64, (1975), announced in · Zbl 0304.05013 [11] Lehman, A, A solution to the Shannon switching game, J. SIAM, 12, 687-725, (1964) · Zbl 0137.38704 [12] Minty, G.J, On the axiomatic foundations of the theories of directed linear graphs, electrical networks, and network programming, (), 15, 485-520, (1966), reprinted in · Zbl 0141.21601 [13] Rockafellar, R.T, The elementary vectors of a subspace of Rn, (), 104-127 [14] Tutte, W.T, Lectures on matroids, J. res. nat. bur. stand. B, 69, 1-47, (1965) · Zbl 0151.33801 [15] Whitney, H, On the abstract properties of linear dependence, Amer. J. math., 57, 507-553, (1935) · JFM 61.0073.03
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.