Oliver Riordan

Electron. J. Comb., 2024

2022

Random cliques in random graphs and sharp thresholds for F $$ F $$ -factors.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

2018

Counting dense connected hypergraphs via the probabilistic method.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

2017

Exploring hypergraphs with martingales.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

The Threshold for Jigsaw Percolation on Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

On the Maximum Running Time in Graph Bootstrap Percolation.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

Counting racks of order n.

[BibT_eX]

[DOI]

Matthew Ashford

Electron. J. Comb., 2017

2016

On the threshold for rainbow connection number r in random graphs.

[BibT_eX]

[DOI]

Annika Heckel

Graphs Comb., 2016

Convergence of Achlioptas Processes via Differential Equations with Unique Solutions.

[BibT_eX]

[DOI]

Lutz Warnke

Comb. Probab. Comput., 2016

Counting Connected Hypergraphs via the Probabilistic Method.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

2015

The evolution of subcritical Achlioptas processes.

[BibT_eX]

[DOI]

Lutz Warnke

Random Struct. Algorithms, 2015

The Janson inequalities for general up-sets.

[BibT_eX]

[DOI]

Lutz Warnke

Random Struct. Algorithms, 2015

An old approach to the giant component problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

2014

Long cycles in random subgraphs of graphs with large minimum degree.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

2012

Asymptotic normality of the size of the giant component in a random hypergraph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Asymptotic normality of the size of the giant component via a random walk.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Linear algebra and bootstrap percolation.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

Monotone Graph Limits and Quasimonotone Graphs.

[BibT_eX]

[DOI]

Internet Math., 2012

The Phase Transition in the Configuration Model.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

Susceptibility in Inhomogeneous Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

The Hitting Time of Rainbow Connection Number Two.

[BibT_eX]

[DOI]

Annika Heckel

Electron. J. Comb., 2012

A Simple Branching Process Approach to the Phase Transition in Gn, p.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

Duality in inhomogeneous random graphs, and the cut metric.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Sparse graphs: Metrics and random models.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Sparse random graphs with clustering.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

On covering by translates of a set.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

2010

The Diameter of Sparse Random Graphs.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Comb. Probab. Comput., 2010

2009

Clique percolation.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

Line-of-Sight Percolation.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

2008

Percolation on dual lattices with k-fold symmetry.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

The k-Core and Branching Processes.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

2007

Spread-out percolation in Rd.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

The phase transition in inhomogeneous random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

A note on the Harris-Kesten Theorem.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

2006

Sharp thresholds and percolation in the plane.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

Percolation.

[BibT_eX]

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

2005

Slow emergence of the giant component in the growing m-out graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

The phase transition in the uniformly grown random graph has infinite order.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

2004

The Diameter of a Scale-Free Random Graph.

[BibT_eX]

[DOI]

Comb., 2004

On the Value of a Random Minimum Weight Steiner Tree.

[BibT_eX]

[DOI]

Comb., 2004

The Phase Transition and Connectedness in Uniformly Grown Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

2003

Disjointly representing set systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

Graphs with large maximum degree containing no odd cycles of a given length.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Coupling Scale-Free and Classical Random Graphs.

[BibT_eX]

[DOI]

Internet Math., 2003

Robustness and Vulnerability of Scale-Free Random Graphs.

[BibT_eX]

[DOI]

Internet Math., 2003

Directed scale-free graphs.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Degree Distribution of the FKP Network Model.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Nonrepetitive colorings of graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

2001

The degree sequence of a scale-free random graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

2000

Contraction-Deletion Invariants for Graphs.

[BibT_eX]

[DOI]

Luke Pebody

J. Comb. Theory B, 2000

Polychromatic polynomials.

[BibT_eX]

[DOI]

Discret. Math., 2000

The Maximum Degree Of A Random Graph.

[BibT_eX]

[DOI]

Alex Selby

Comb. Probab. Comput., 2000

Spanning Subgraphs Of Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

Constrained Graph Processes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

1999

Closure and Hamiltonian-connectivity of claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

An Ordering on the Even Discrete Torus.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

Colorings generated by monotone properties.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

On some conjectures of Graffiti.

[BibT_eX]

[DOI]