arXiv (All)
open access
The Strong Secretary Conjecture is True for Linear Matroids
We prove a $1/e$ guarantee for the matroid secretary problem on linear matroids, therefore settling the strong secretary conjecture in this class of matroids. The result holds both when the matroid is known in advance and when a linear representation over a finite field is given online. In the known
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A 3.1462-Competitive Algorithm for Matroid Secretary#1160784
- A 3.7321-Competitive Algorithm for Matroid Secretary#1011503
- A Minimax Perspective on Almost-Stable Matchings#920263
- Sharper Zarankiewicz and Diagonal Bipartite Ramsey Bounds#1117649
- An Independent Border-Free Type-A Cover of Q221 and Improved Asymptotic Bounds for Queen Domination#821546
Record · ID 1034589
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive