ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A rank-rr matroid is paving if all its circuits have cardinality at least rr. For each positive integer nn, consider matroids on an nn-element ground set. The paving matroid conjecture. Asymptotically almost all matroids on nn 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 (1+o(1))(1+o(1))-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.