3 problems

Matching

Logarithmic path-length conjecture for the (1,1) edge-removal process
Logarithmic path-length conjecture. The expected maximum directed path length of the resulting task-dependency graph is
opengraph-theory random-processes task-dependency-graphs
05
Quadratic edge-count conjecture for the (1,1) edge-addition process
Quadratic edge-count conjecture.
opengraph-theory random-processes task-dependency-graphs
05
Asymptotic success probability conjecture for the edge-addition process
Edge-addition success-probability conjecture.
opengraph-theory random-processes task-dependency-graphs
06