most citedHow Complex are Random Graphs in First Order Logic?

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing math.PRShow all

1 paper · 1 filter

math.PR2000

The cover time, the blanket time, and the Matthews bound

J. Kahn, J. H. Kim, L. Lovasz +1

The cover time C of a graph G is the expected time for a random walk starting from the worst vertex to cover all vertices in G. Similarly, the blanket time B is the expected time t…