ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG range over graphs. For each K∈NK\in\mathbb{N}, let αK\alpha_K denote the smallest KK-asymptotic robustness ratio over all graphs, and let α∗(G)\alpha^*(G) denote the randomized robustness ratio of GG. Asymptotic robustness limit conjecture.

lim⁡K→∞αK=inf⁡Gα∗(G)\lim_{K \rightarrow \infty} \alpha_{K} = \inf_{G} \alpha^*(G)

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.