The Thin Matching Problem
Prior state unknown→proved
up to polylogarithmic factors
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algorithms-optimization / Graph algorithms
The Thin Matching Problem
Anari, Charikar and Ramakrishnan asked whether every fractional perfect matching admits a perfect matching that is $\alpha$-thin with respect to it, meaning it crosses every cut at most $\alpha$ times the fractional amount. Resolved up to polylogarithmic factors.
15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
Anari, Charikar and Ramakrishnan asked whether every fractional perfect matching admits a perfect matching that is $\alpha$-thin with respect to it, meaning it crosses every cut at most $\alpha$ times the fractional amount. Resolved up to polylogarithmic factors.
up to polylogarithmic factors
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.