Pith. sign in

REVIEW

Rota's Basis Conjecture holds asymptotically

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2008.06045 v1 pith:GNTOZSKD submitted 2020-08-13 math.CO

classification math.CO
keywords basesbasisconjecturedisjointmatroidpossiblerainbowrota
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Rota's Basis Conjecture is a well known problem from matroid theory, that states that for any collection of $n$ bases in a rank $n$ matroid, it is possible to decompose all the elements into $n$ disjoint rainbow bases. Here an asymptotic version of this is proved. We show that it is possible to find $n-o(n)$ disjoint rainbow independent sets of size $n-o(n)$.

Discussion (0). Sign in to comment.

Pith tools