
doi: 10.2307/2045902
Summary: A new, surprisingly simple proof is given of the finiteness of the set of matroids minor-minimally not representable over GF(3). It is, in fact, proved that every such matroid has rank or corank at most 3.
Combinatorial aspects of finite geometries, Combinatorial aspects of matroids and geometric lattices, matroids
Combinatorial aspects of finite geometries, Combinatorial aspects of matroids and geometric lattices, matroids
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
