Published online by Cambridge University Press: 20 November 2018
In this note we study dependence in matroids as an exercise in combinational algebra. Because the work seems to have little connection with graph theory we will not use Tutte′s approach (1) which uses dual concepts. To define a matroid we use Edmunds (2).