2 research outputs found
Matroids with no -minor and many hyperplanes
We construct, for every and every prime power , a rank-
matroid with no -minor, having more hyperplanes than the rank-
projective geometry over
The number of lines in a matroid with no -minor
We show that, if is a prime power at most 5, then every rank- matroid
with no -minor has no more lines than a rank- projective geometry
over GF. We also give examples showing that for every other prime power
this bound does not hold