The threshold for a spanning comb Combn in G(n,p) is conjectured to have order (log n)/n; more generally, the same threshold is conjectured for every n-vertex tree of bounded…
Statement
The threshold for a spanning comb Combn in G(n,p) is conjectured to have order (log n)/n; more generally, the same threshold is conjectured for every n-vertex tree of bounded degree.
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.