1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2004★ 1 cited
How Complex are Random Graphs in First Order Logic?
Jeong Han Kim, Oleg Pikhurko, Joel Spencer +1
It is not hard to write a first order formula which is true for a given graph G but is false for any graph not isomorphic to G. The smallest number $(G) of nested quantifiers in a…
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…