The sparse paving minor conjecture

A matroid NN is sparse paving if every dependent set of cardinality equal to its rank is a circuit-hyperplane. A matroid MM has NN as a minor if NN is obtained from MM by a sequence of deletions and contractions.

Sparse paving minor conjecture. Let NN be a fixed sparse paving matroid. Asymptotically almost every matroid has an NN-minor.

The conjecture is known when NN is any uniform matroid, but the paper says it remains open even for small examples such as W3W^3 and M(K4)M(K_4). It asks whether every fixed sparse paving matroid occurs as a minor of almost every matroid.

Sources & referencesView supporting material

Primary source

Rudi Pendavingh and Jorn van der Pol, “On the number of bases of almost all matroids”, arXiv:1602.04763 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.