Rota's conjecture states that the number of minimal excluded minors for the class of GF (q)-
representable matroids is finite. The conjecture holds for q= 2, 3, and 4, but remains …

In this paper we present an algorithm for the problem of exhaustive equivalence-free
generation of 3-connected matroids which are represented by a matrix over some finite …

Matroids (also called combinatorial geometries) present a strong combinatorial
generalization of graphs and matrices. Unlike isomorph-free generation of graphs, which …

Oid is an interactive extensible software system for studying matroids. Since matroids are a
generalization of many other combinatorial objects such as graphs, matrices and linear …

Rayleigh matroids are a class of matroids with sets of bases that satisfy a strong negative
correlation property. Interesting characteristics include the existence of an efficient algorithm …