ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of minimum degree DD. Obtain a lower bound for the largest integer dd such that the random subgraph G1/2G_{1/2}, formed by retaining each edge independently with probability 1/21/2, contains a non-empty subgraph of minimum degree dd. Conjecture: dgeD/3−o(D)d \\ge D/3-o(D) for any GG.

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.