Let G have minimum degree D, retain each edge independently with probability one half, and let d be the largest minimum degree of a nonempty subgraph of the random subgraph.
Statement
Let G have minimum degree D, retain each edge independently with probability one half, and let d be the largest minimum degree of a nonempty subgraph of the random subgraph. How large must d be in terms of D; in particular, is d at least D/3-o(D) for every G?
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.