According to our database
1,
Oliver Riordan
authored at least 59 papers
between 1998 and 2022.
Collaborative distances:
2022
Random cliques in random graphs and sharp thresholds for F $$ F $$ -factors.
Random Struct. Algorithms, 2022
2018
Counting dense connected hypergraphs via the probabilistic method.
Random Struct. Algorithms, 2018
2017
Exploring hypergraphs with martingales.
Random Struct. Algorithms, 2017
The Threshold for Jigsaw Percolation on Random Graphs.
Electron. J. Comb., 2017
On the Maximum Running Time in Graph Bootstrap Percolation.
Electron. J. Comb., 2017
Counting racks of order n.
Electron. J. Comb., 2017
2016
On the threshold for rainbow connection number r in random graphs.
Graphs Comb., 2016
Convergence of Achlioptas Processes via Differential Equations with Unique Solutions.
Comb. Probab. Comput., 2016
Counting Connected Hypergraphs via the Probabilistic Method.
Comb. Probab. Comput., 2016
2015
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 B, 2015
2014
Long cycles in random subgraphs of graphs with large minimum degree.
Random Struct. Algorithms, 2014
2012
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 B, 2012
Linear algebra and bootstrap percolation.
J. Comb. Theory A, 2012
Monotone Graph Limits and Quasimonotone Graphs.
Internet Math., 2012
The Phase Transition in the Configuration Model.
Comb. Probab. Comput., 2012
Susceptibility in Inhomogeneous Random Graphs.
Electron. J. Comb., 2012
The Hitting Time of Rainbow Connection Number Two.
Electron. J. Comb., 2012
A Simple Branching Process Approach to the Phase Transition in G<sub>n, p</sub>.
Electron. J. Comb., 2012
2011
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
2010
The Diameter of Sparse Random Graphs.
Comb. Probab. Comput., 2010
2009
Random Struct. Algorithms, 2009
Line-of-Sight Percolation.
Comb. Probab. Comput., 2009
2008
Percolation on dual lattices with <i>k</i>-fold symmetry.
Random Struct. Algorithms, 2008
The k-Core and Branching Processes.
Comb. Probab. Comput., 2008
2007
Degree distribution of the FKP network model.
Theor. Comput. Sci., 2007
Spread-out percolation in R<sup>d</sup>.
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
2006
Sharp thresholds and percolation in the plane.
Random Struct. Algorithms, 2006
Cambridge University Press, ISBN: 978-0-521-87232-4, 2006
2005
Slow emergence of the giant component in the growing <i>m</i>-out graph.
Random Struct. Algorithms, 2005
The phase transition in the uniformly grown random graph has infinite order.
Random Struct. Algorithms, 2005
2004
The Diameter of a Scale-Free Random Graph.
Comb., 2004
On the Value of a Random Minimum Weight Steiner Tree.
Comb., 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
2003
Disjointly representing set systems.
J. Comb. Theory A, 2003
Graphs with large maximum degree containing no odd cycles of a given length.
J. Comb. Theory B, 2003
Coupling Scale-Free and Classical Random Graphs.
Internet Math., 2003
Robustness and Vulnerability of Scale-Free Random Graphs.
Internet Math., 2003
Directed scale-free graphs.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
2002
Nonrepetitive colorings of graphs.
Random Struct. Algorithms, 2002
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number.
Comb. Probab. Comput., 2002
2001
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
2000
Contraction-Deletion Invariants for Graphs.
J. Comb. Theory B, 2000
Polychromatic polynomials.
Discret. Math., 2000
The Maximum Degree Of A Random Graph.
Comb. Probab. Comput., 2000
Spanning Subgraphs Of Random Graphs.
Comb. Probab. Comput., 2000
Constrained Graph Processes.
Electron. J. Comb., 2000
1999
Closure and Hamiltonian-connectivity of claw-free graphs.
Discret. Math., 1999
1998
An Ordering on the Even Discrete Torus.
SIAM J. Discret. Math., 1998
Colorings generated by monotone properties.
Random Struct. Algorithms, 1998
On some conjectures of Graffiti.
Discret. Math., 1998
