Bérczi–Schwarcz–Yamaguchi coverability conjecture for matroids
Bérczi–Schwarcz–Yamaguchi coverability conjecture for matroids
Let be a matroid. It is -coverable if its ground set can be covered by at most independent sets from . A partition matroid on the same ground set is likewise -coverable when its ground set has such a cover. Bérczi–Schwarcz–Yamaguchi conjecture. Every -coverable matroid can be reduced to a -coverable partition matroid on the same ground set . The paper states that this conjecture is refuted by its results, so the proposed universal reduction does not hold.
Sources & referencesView supporting material
Primary source
Dorna Abdolazimi, Anna R. Karlin, Nathan Klein and Shayan Oveis Gharan, “Matroid Partition Property and the Secretary Problem”, arXiv:2111.12436 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.