hasMinor(M, N)
Determines if N is a minor of M, i.e. can be obtained from M by a contraction followed by a deletion. Since deletion and contraction by disjoint subsets commute, every sequence of deletion and contraction operations can be written as a single contraction and a single deletion.
Many families of matroids can be defined by a list of forbidden minors: i.e. a matroid M is in the family iff M does not have any of the forbidden minors as a minor. For instance, a matroid is representable over F_2 iff it does not have U_{2,4} as a minor, i.e. U_{2,4} is the (sole) forbidden minor for binary matroids.
There are 2 strategies for this method: the default (and generally fastest) method is ``Strategy => "flats"'', which can be sped up by precomputing the fVector of M. Otherwise, all independent/coindependent sets of a certain size/rank are iterated over.



The object hasMinor is a method function with options.