The asymptotic robustness limit conjecture for matchings
Statement
Let range over graphs. For each , let denote the smallest -asymptotic robustness ratio over all graphs, and let denote the randomized robustness ratio of . Asymptotic robustness limit conjecture.
This conjecture would follow from a sparsification result for arbitrary randomized matchings, extending the constant-support sparsification established for the distributions used earlier in the paper. It asserts that the limiting deterministic asymptotic robustness ratio equals the worst-case randomized robustness ratio.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.