Changes
* If ''l''=1 and <math>m \equiv 1</math> then we get the cycle matroid of ''G''.
* If ''l=k'' and <math>m \equiv k</math> for some positive integer ''k'' then by [[Nash-Williams' forest cover theorem]] the independent sets are the edge-sets that can be partitioned into ''k'' forests.
* If ''l=2'' and <math>m \equiv 3</math> then we get the '''[[Rigidity matrix|2-dimensional rigidity matroid''' ]] of the graph ''G'' by [[Laman's theorem]], see the page [[Rigid graph]].
==Directed graphs==
