ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let αˉ(G)\bar{\alpha}(G) be the maximum uniform measure of an independent set. Let α∗(G)\alpha^*(G) be the largest expected normalized size of an independent set found inside a positively correlated random union of vertex parts, and define

ϵ∗(α)=inf⁡G: αˉ(G)≥α{αˉ(G)−α∗(G)}.\epsilon^*(\alpha)=\inf_{G:\,\bar{\alpha}(G)\geq\alpha}\left\{\bar{\alpha}(G)-\alpha^*(G)\right\}.

Positive random-subgraph independence-gap conjecture. ϵ∗(α)>0\epsilon^*(\alpha)>0 for all α∈(0,1/2)\alpha\in(0,1/2). This conjecture is proposed as a general statement about independent sets in random subgraphs; the paper explains that it would imply decay of normalized independence numbers for Hamming powers of the Kneser graph and thus Levine's conjecture.

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.