Counting connected hypergraphs via the probabilistic method
Bollobás, B
Riordan, O
(23 Apr 2014)
doi:10.48550/arxiv.1404.5887
On the threshold for rainbow connection number r in random graphs
Heckel, A
Riordan, O
(29 Jul 2013)
doi:10.48550/arxiv.1307.7747
Exploring hypergraphs with martingales
Bollobás, B
Riordan, O
(25 Mar 2014)
doi:10.48550/arxiv.1403.6558
Counting dense connected hypergraphs via the probabilistic method
Bollobás, B
Riordan, O
(15 Nov 2015)
doi:10.48550/arxiv.1511.04739
Spread-out percolation in R^d
Bollobas, B
Janson, S
Riordan, O
(23 Aug 2005)
doi:10.48550/arxiv.math/0508430
Long cycles in random subgraphs of graphs with large minimum degree
Riordan, O
(14 Aug 2013)
doi:10.48550/arxiv.1308.3144
Sesqui-type branching processes
Janson, S
Riordan, O
Warnke, L
(01 Jun 2017)
doi:10.48550/arxiv.1706.00283
A note on Linnik's Theorem on quadratic non-residues
Balister, P
Bollobás, B
Lee, J
Morris, R
Riordan, O
(19 Dec 2017)
doi:10.48550/arxiv.1712.07179
The critical probability for random Voronoi percolation in the plane is 1/2
Bollobas, B
Riordan, O
(14 Oct 2004)
doi:10.48550/arxiv.math/0410336
A short proof of the Harris-Kesten Theorem
Bollobas, B
Riordan, O
(15 Oct 2004)
doi:10.48550/arxiv.math/0410359