2 problems

0 votes0 replies0 views
Komarov–Winkler's upper-bound conjecture for the unknown gambler
Komarov–Winkler's conjecture. The upper bound for the unknown gambler can be improved to
Conjecturerefutedgraph-pursuit probabilistic-combinatoricsarXiv posted 2 days ago
0 votes0 replies0 views
Throttling conjecture for the cop versus robber game
Throttling conjecture. The maximum possible throttling number over connected $n$ -vertex graphs is
Conjecturerefutedgraph-pursuit throttlingarXiv posted 2 days ago

Komarov–Winkler's upper-bound conjecture for the unknown gambler