The cut metric, random graphs, and branching processes
Bollobas, B
Janson, S
Riordan, O
(14 Jan 2009)
doi:10.48550/arxiv.0901.2091
Percolation on self-dual polygon configurations
Bollobas, B
Riordan, O
(26 Jan 2010)
doi:10.48550/arxiv.1001.4674
The Janson inequalities for general up-sets
Riordan, O
Warnke, L
(05 Mar 2012)
doi:10.48550/arxiv.1203.1024
Achlioptas process phase transitions are continuous
Riordan, O
Warnke, L
(25 Feb 2011)
doi:10.48550/arxiv.1102.5306
The Diameter of a Scale-Free Random Graph
Bollobás*, B
Riordan, O
Combinatorica
volume 24
issue 1
5-34
(Jan 2004)
doi:10.1007/s00493-004-0002-2
Colorings generated by monotone properties
Bollobás, B
Riordan, O
Random Structures and Algorithms
volume 12
issue 1
1-25
(07 Jan 1998)
doi:10.1002/(sici)1098-2418(199801)12:1<1::aid-rsa1>3.0.co;2-2
A Tutte Polynomial for Coloured Graphs
BOLLOBÁS, B
RIORDAN, O
Combinatorics Probability Computing
volume 8
issue 1-2
45-93
(01 Jan 1999)
doi:10.1017/s0963548398003447
Linearized chord diagrams and an upper bound for vassiliev invariants
Bollobás, B
Riordan, O
Journal of Knot Theory and Its Ramifications
volume 9
issue 07
847-853
(21 Nov 2000)
doi:10.1142/s0218216500000475
Contraction–Deletion Invariants for Graphs
Bollobás, B
Pebody, L
Riordan, O
Journal of Combinatorial Theory Series B
volume 80
issue 2
320-345
(Nov 2000)
doi:10.1006/jctb.2000.1988
The Maximum Degree of a Random Graph
RIORDAN, O
SELBY, A
Combinatorics Probability Computing
volume 9
issue 6
549-572
(09 Nov 2000)
doi:10.1017/s0963548300004491