167 citations · 675 across the 52 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009★ 119 cited
The early evolution of the H-free process
Tom Bohman, Peter Keevash
The H-free process, for some fixed graph H, is the random graph process defined by starting with an empty graph on n vertices and then adding edges one at a time, chosen uniformly…
math.CO2009
Pancyclicity of Hamiltonian and highly connected graphs
Peter Keevash, Benny Sudakov
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all . Write for the inde…