Exponential upper bound for linear-time graph covering
Statement
For every , prove that there is such that, for every simple -vertex graph , the probability that simple random walk covers all of within steps is at most .
Record
- Source
- Added
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.