554 citations · 1.7k across the 51 of their papers we have counts for
5 papers · 1 filter
The hitting time of rainbow connection number two
Annika Heckel, Oliver Riordan
In a graph with a given edge colouring, a rainbow path is a path all of whose edges have distinct colours. The minimum number of colours required to colour the edges of so…
An old approach to the giant component problem
Bela Bollobas, Oliver Riordan
In 1998, Molloy and Reed showed that, under suitable conditions, if a sequence of degree sequences converges to a probability distribution , then the size of the largest compone…
A simple branching process approach to the phase transition in
Bela Bollobas, Oliver Riordan
It is well known that the branching process approach to the study of the random graph gives a very simple way of understanding the size of the giant component when it is…
The evolution of subcritical Achlioptas processes
Oliver Riordan, Lutz Warnke
In Achlioptas processes, starting from an empty graph, in each step two potential edges are chosen uniformly at random, and using some rule one of them is selected and added to the…
The Janson inequalities for general up-sets
Oliver Riordan, Lutz Warnke
Janson and Janson, Luczak and Rucinski proved several inequalities for the lower tail of the distribution of the number of events that hold, when all the events are up-sets (increa…