Abstract
Matroid theory was first studied by Whitney (1) as an abstract theory of linear independence in vector spaces. Recently its importance in graph theory has been noticed by Tutte (2), Edmonds (3) and Nash-Williams (4,5). Less interest has been shown in the extremely close relationship between matroids and incidence geometries. In this note we develop the more geometrical aspects of matroid theory, paying particular attention to the fundamental role of the hyperplanes of a matroid in this theory.
Publisher
Cambridge University Press (CUP)
Reference13 articles.
1. A combinatorial condition for planar graphs;Maclane;Fund. Math,1937
2. On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network programming;Minty;J. Math. Mech,1966
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献