Asymptotic success probability conjecture for the edge-addition process
Statement
For fixed , let denote the probability that the edge-addition process on vertices generates an task-dependency graph.
Edge-addition success-probability conjecture.
This conjecture is based on experimental results indicating that the probability approaches as the number of vertices grows. No proof or resolution is provided in the source.
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.