Embedding spanning bounded degree subgraphs in randomly perturbed graphs

Hamiltonian circuits in random graphs

L. Pósa · Discrete Mathematics · 1976 · 468 citations

Natural Sciences, Mathematics, Physics +11

Threshold functions

B. Bollobás, Andrew Thomason · COMBINATORICA · 1987 · 293 citations

On the existence of a factor of degree one of a connected random graph

P. Erdös, A. Rényi · Acta Mathematica Academiae Scientiarum Hungaricae · 1966 · 195 citations

Natural Sciences, Computer Science, Mathematics +10

Hall's theorem for hypergraphs

Ron Aharoni, Penny Haxell · Journal of Graph Theory · 2000 · 112 citations

Natural Sciences, Computer Science, Mathematics +12

How many random edges make a dense graph hamiltonian?

Tom Bohman, Alan Frieze, Ryan R. Martin · Random Structures and Algorithms · 2002 · 100 citations

Natural Sciences, Computer Science, Mathematics +11