On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.
Loose Hamilton cycles in random 3-uniform hypergraphs.
A simple algorithm for constructing Szemerédi's regularity partition.
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold.
On randomly colouring locally sparse graphs.
On rainbow trees and cycles.
On the chromatic number of simple triangle-free triple systems.
Loose Hamilton cycles in random uniform hypergraphs.
A note on random minimum length spanning trees.
Multicoloured Hamilton cycles.
Logconcave random graphs.
min-wise independent linear permutations.
Random -sat: the limiting probability for satisfiability for moderately growing .
On randomly generated intersecting hypergraphs.
A note on sparse random graphs and cover graphs.
Page 1