The sparse paving minor conjecture
The sparse paving minor conjecture
A matroid is sparse paving if every dependent set of cardinality equal to its rank is a circuit-hyperplane. A matroid has as a minor if is obtained from by a sequence of deletions and contractions.
Sparse paving minor conjecture. Let be a fixed sparse paving matroid. Asymptotically almost every matroid has an -minor.
The conjecture is known when is any uniform matroid, but the paper says it remains open even for small examples such as and . 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.