Improved bounds for Rota's Basis Conjecture
Sally Dong, Jim Geelen

TL;DR
This paper establishes a new lower bound on the number of disjoint basis transversals in a matroid, improving understanding of Rota's Basis Conjecture by providing quantitative bounds.
Contribution
It introduces a novel lower bound on the number of disjoint basis transversals in a matroid, advancing the theoretical understanding of Rota's Basis Conjecture.
Findings
At least loor(n/(6 eil(log n)))isjoint basis transversals exist
Provides a logarithmic factor in the lower bound
Advances the theoretical bounds related to Rota's Basis Conjecture
Abstract
We prove that, if are disjoint bases of a rank- matroid, then there are at least disjoint transversals of that are also bases.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Graph Theory Research · Coding theory and cryptography
