The paving matroid conjecture
Statement
A rank- matroid is paving if all its circuits have cardinality at least . For each positive integer , consider matroids on an -element ground set. The paving matroid conjecture. Asymptotically almost all matroids on elements are paving. This conjecture is central in asymptotic matroid theory and is attributed to Mayhew, Newman, Welsh, and Whittle. If true, it would yield a -competitive matroid secretary algorithm for almost all matroids.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.