Oliver Riordan

According to our database1, Oliver Riordan authored at least 58 papers between 1998 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Counting dense connected hypergraphs via the probabilistic method.
Random Struct. Algorithms, 2018

Exploring hypergraphs with martingales.
Random Struct. Algorithms, 2017

The Threshold for Jigsaw Percolation on Random Graphs.
Electr. J. Comb., 2017

On the Maximum Running Time in Graph Bootstrap Percolation.
Electr. J. Comb., 2017

Counting racks of order n.
Electr. J. Comb., 2017

On the threshold for rainbow connection number r in random graphs.
Graphs and Combinatorics, 2016

Convergence of Achlioptas Processes via Differential Equations with Unique Solutions.
Combinatorics, Probability & Computing, 2016

Counting Connected Hypergraphs via the Probabilistic Method.
Combinatorics, Probability & Computing, 2016

The evolution of subcritical Achlioptas processes.
Random Struct. Algorithms, 2015

The Janson inequalities for general up-sets.
Random Struct. Algorithms, 2015

An old approach to the giant component problem.
J. Comb. Theory, Ser. B, 2015

Long cycles in random subgraphs of graphs with large minimum degree.
Random Struct. Algorithms, 2014

Asymptotic normality of the size of the giant component in a random hypergraph.
Random Struct. Algorithms, 2012

Asymptotic normality of the size of the giant component via a random walk.
J. Comb. Theory, Ser. B, 2012

Linear algebra and bootstrap percolation.
J. Comb. Theory, Ser. A, 2012

Monotone Graph Limits and Quasimonotone Graphs.
Internet Mathematics, 2012

The Phase Transition in the Configuration Model.
Combinatorics, Probability & Computing, 2012

Susceptibility in Inhomogeneous Random Graphs.
Electr. J. Comb., 2012

The Hitting Time of Rainbow Connection Number Two.
Electr. J. Comb., 2012

A Simple Branching Process Approach to the Phase Transition in Gn, p.
Electr. J. Comb., 2012

Duality in inhomogeneous random graphs, and the cut metric.
Random Struct. Algorithms, 2011

Sparse graphs: Metrics and random models.
Random Struct. Algorithms, 2011

Sparse random graphs with clustering.
Random Struct. Algorithms, 2011

On covering by translates of a set.
Random Struct. Algorithms, 2011

The Diameter of Sparse Random Graphs.
Combinatorics, Probability & Computing, 2010

Clique percolation.
Random Struct. Algorithms, 2009

Line-of-Sight Percolation.
Combinatorics, Probability & Computing, 2009

Percolation on dual lattices with k-fold symmetry.
Random Struct. Algorithms, 2008

The k-Core and Branching Processes.
Combinatorics, Probability & Computing, 2008

Spread-out percolation in Rd.
Random Struct. Algorithms, 2007

The phase transition in inhomogeneous random graphs.
Random Struct. Algorithms, 2007

A note on the Harris-Kesten Theorem.
Eur. J. Comb., 2007

Sharp thresholds and percolation in the plane.
Random Struct. Algorithms, 2006

Cambridge University Press, ISBN: 978-0-521-87232-4, 2006

Slow emergence of the giant component in the growing m-out graph.
Random Struct. Algorithms, 2005

The phase transition in the uniformly grown random graph has infinite order.
Random Struct. Algorithms, 2005

The Diameter of a Scale-Free Random Graph.
Combinatorica, 2004

On the Value of a Random Minimum Weight Steiner Tree.
Combinatorica, 2004

The Phase Transition and Connectedness in Uniformly Grown Random Graphs.
Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

Disjointly representing set systems.
J. Comb. Theory, Ser. A, 2003

Graphs with large maximum degree containing no odd cycles of a given length.
J. Comb. Theory, Ser. B, 2003

Coupling Scale-Free and Classical Random Graphs.
Internet Mathematics, 2003

Robustness and Vulnerability of Scale-Free Random Graphs.
Internet Mathematics, 2003

Directed scale-free graphs.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Degree Distribution of the FKP Network Model.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Nonrepetitive colorings of graphs.
Random Struct. Algorithms, 2002

Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number.
Combinatorics, Probability & Computing, 2002

The degree sequence of a scale-free random graph process.
Random Struct. Algorithms, 2001

Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial.
Eur. J. Comb., 2001

Contraction-Deletion Invariants for Graphs.
J. Comb. Theory, Ser. B, 2000

Polychromatic polynomials.
Discrete Mathematics, 2000

The Maximum Degree Of A Random Graph.
Combinatorics, Probability & Computing, 2000

Spanning Subgraphs Of Random Graphs.
Combinatorics, Probability & Computing, 2000

Constrained Graph Processes.
Electr. J. Comb., 2000

Closure and Hamiltonian-connectivity of claw-free graphs.
Discrete Mathematics, 1999

An Ordering on the Even Discrete Torus.
SIAM J. Discrete Math., 1998

Colorings generated by monotone properties.
Random Struct. Algorithms, 1998

On some conjectures of Graffiti.
Discrete Mathematics, 1998