Degeneracy of a random half-subgraph
Statement
Let be a graph of minimum degree . Obtain a lower bound for the largest integer such that the random subgraph , formed by retaining each edge independently with probability , contains a non-empty subgraph of minimum degree . Conjecture: for any .
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.