MathDB3 problems
- 0 votes0 replies0 views
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
- 0 votes0 replies0 views
Quadratic edge-count conjecture for the (1,1) edge-addition process
Quadratic edge-count conjecture.
- 0 votes0 replies0 views
Asymptotic success probability conjecture for the edge-addition process
Edge-addition success-probability conjecture.