| Publication | Date of Publication | Type |
|---|
Thresholds, expectation thresholds and cloning The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
How does the chromatic number of a random graph vary? Journal of the London Mathematical Society | 2023-12-19 | Paper |
Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors Random Structures & Algorithms | 2023-10-17 | Paper |
Essential properties of the Tutte polynomial Handbook of the Tutte Polynomial and Related Topics | 2023-04-28 | Paper |
| Thresholds and expectation thresholds for larger p | 2023-02-07 | Paper |
A note on Linnik's theorem on quadratic non-residues Archiv der Mathematik | 2019-03-27 | Paper |
Sesqui-type branching processes Stochastic Processes and their Applications | 2018-10-31 | Paper |
Counting dense connected hypergraphs via the probabilistic method Random Structures & Algorithms | 2018-09-25 | Paper |
Convergence of Achlioptas processes via differential equations with unique solutions Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Counting connected hypergraphs via the probabilistic method Combinatorics, Probability and Computing | 2017-10-04 | Paper |
The threshold for jigsaw percolation on random graphs The Electronic Journal of Combinatorics | 2017-07-13 | Paper |
The threshold for jigsaw percolation on random graphs The Electronic Journal of Combinatorics | 2017-07-13 | Paper |
Counting racks of order \(n\) The Electronic Journal of Combinatorics | 2017-06-13 | Paper |
Counting racks of order \(n\) The Electronic Journal of Combinatorics | 2017-06-13 | Paper |
Exploring hypergraphs with martingales Random Structures & Algorithms | 2017-06-02 | Paper |
On the maximum running time in graph bootstrap percolation The Electronic Journal of Combinatorics | 2017-05-18 | Paper |
On the maximum running time in graph bootstrap percolation The Electronic Journal of Combinatorics | 2017-05-18 | Paper |
| The phase transition in bounded-size Achlioptas processes | 2017-04-27 | Paper |
| A local limit theorem for Quicksort key comparisons via multi-round smoothing | 2017-01-16 | Paper |
On the threshold for rainbow connection number \(r\) in random graphs Graphs and Combinatorics | 2016-03-02 | Paper |
The evolution of subcritical Achlioptas processes Random Structures & Algorithms | 2015-10-12 | Paper |
Long cycles in random subgraphs of graphs with large minimum degree Random Structures & Algorithms | 2015-06-22 | Paper |
An old approach to the giant component problem Journal of Combinatorial Theory. Series B | 2015-06-10 | Paper |
The Janson inequalities for general up-sets Random Structures & Algorithms | 2015-04-09 | Paper |
The phase transition in the Erdős-Rényi random graph process Bolyai Society Mathematical Studies | 2014-05-19 | Paper |
| Essential enhancements revisited | 2014-02-04 | Paper |
The hitting time of rainbow connection number two The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
The hitting time of rainbow connection number two The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
A simple branching process approach to the phase transition in \(G_{n,p}\) The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
A simple branching process approach to the phase transition in \(G_{n,p}\) The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
The diameter of sparse random graphs Combinatorics, Probability and Computing | 2013-03-13 | Paper |
Monotone graph limits and quasimonotone graphs Internet Mathematics | 2013-02-15 | Paper |
Monotone graph limits and quasimonotone graphs Internet Mathematics | 2013-02-15 | Paper |
Asymptotic normality of the size of the giant component in a random hypergraph Random Structures & Algorithms | 2012-12-14 | Paper |
Achlioptas process phase transitions are continuous The Annals of Applied Probability | 2012-09-19 | Paper |
Achlioptas process phase transitions are continuous The Annals of Applied Probability | 2012-09-19 | Paper |
The inefficiency of re-weighted sampling and the curse of system size in high-order path integration Proceedings of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences | 2012-07-31 | Paper |
Susceptibility in inhomogeneous random graphs The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Susceptibility in inhomogeneous random graphs The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Linear algebra and bootstrap percolation Journal of Combinatorial Theory. Series A | 2012-06-04 | Paper |
The phase transition in the configuration model Combinatorics, Probability and Computing | 2012-05-14 | Paper |
Asymptotic normality of the size of the giant component via a random walk Journal of Combinatorial Theory. Series B | 2012-03-19 | Paper |
| Percolation on sequences of graphs | 2011-11-11 | Paper |
Duality in inhomogeneous random graphs, and the cut metric Random Structures & Algorithms | 2011-10-25 | Paper |
Sparse graphs: metrics and random models Random Structures & Algorithms | 2011-08-09 | Paper |
Sparse random graphs with clustering Random Structures & Algorithms | 2011-05-11 | Paper |
Percolation on self-dual polygon configurations (available as arXiv preprint) | 2011-02-18 | Paper |
On covering by translates of a set Random Structures & Algorithms | 2011-01-17 | Paper |
Clique percolation Random Structures & Algorithms | 2010-11-09 | Paper |
The cut metric, random graphs, and branching processes Journal of Statistical Physics | 2010-09-16 | Paper |
Line-of-sight percolation Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Percolation on dense graph sequences The Annals of Probability | 2010-03-08 | Paper |
Erratum to: percolation on random Johnson-Mehl tessellations and related models Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2010-02-09 | Paper |
Metrics for sparse graphs (available as arXiv preprint) | 2010-01-13 | Paper |
Percolation on dual lattices withk-fold symmetry Random Structures & Algorithms | 2008-07-21 | Paper |
Percolation on random Johnson-Mehl tessellations and related models Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2008-04-03 | Paper |
Thek-Core and Branching Processes Combinatorics, Probability and Computing | 2008-03-10 | Paper |
Spread‐out percolation in ℝd Random Structures & Algorithms | 2008-01-08 | Paper |
The phase transition in inhomogeneous random graphs Random Structures & Algorithms | 2007-09-21 | Paper |
A note on the Harris-Kesten theorem European Journal of Combinatorics | 2007-07-27 | Paper |
Degree distribution of the FKP network model Theoretical Computer Science | 2007-07-16 | Paper |
| Rigorous confidence intervals for critical probabilities | 2007-02-08 | Paper |
Sharp thresholds and percolation in the plane Random Structures & Algorithms | 2007-02-07 | Paper |
| Percolation | 2006-12-04 | Paper |
The critical probability for random Voronoi percolation in the plane is 1/2 Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2006-10-16 | Paper |
A SHORT PROOF OF THE HARRIS–KESTEN THEOREM Bulletin of the London Mathematical Society | 2006-08-10 | Paper |
The Small Giant Component in Scale-Free Random Graphs Combinatorics, Probability and Computing | 2005-11-14 | Paper |
Slow emergence of the giant component in the growing m‐out graph Random Structures & Algorithms | 2005-08-29 | Paper |
Algorithms and Models for the Web-Graph Lecture Notes in Computer Science | 2005-08-22 | Paper |
Robustness and Vulnerability of Scale-Free Random Graphs Internet Mathematics | 2005-05-09 | Paper |
The phase transition in the uniformly grown random graph has infinite order Random Structures & Algorithms | 2005-04-21 | Paper |
Coupling Scale-Free and Classical Random Graphs Internet Mathematics | 2005-04-11 | Paper |
On the value of a random minimum weight Steiner tree Combinatorica | 2005-02-14 | Paper |
The diameter of a scale-free random graph Combinatorica | 2004-10-19 | Paper |
| Directed scale-free graphs | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2038750 (Why is no real title available?) | 2004-02-08 | Paper |
Graphs with large maximum degree containing no odd cycles of a given length Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Disjointly representing set systems Journal of Combinatorial Theory. Series A | 2003-05-27 | Paper |
Nonrepetitive colorings of graphs Random Structures & Algorithms | 2003-03-19 | Paper |
Vertex-distinguishing edge colorings of graphs Journal of Graph Theory | 2003-03-10 | Paper |
Contraction-deletion invariants for graphs Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number Combinatorics, Probability and Computing | 2002-11-12 | Paper |
A polynomial of graphs on surfaces Mathematische Annalen | 2002-09-17 | Paper |
Linearized chord diagrams and an upper bound for vassiliev invariants Journal of Knot Theory and Its Ramifications | 2002-07-30 | Paper |
The degree sequence of a scale-free random graph process Random Structures & Algorithms | 2002-05-13 | Paper |
A polynomial invariant of graphs on orientable surfaces Proceedings of the London Mathematical Society. Third Series | 2002-01-28 | Paper |
The maximum degree of a random graph Combinatorics, Probability and Computing | 2001-10-30 | Paper |
Alternating knot diagrams, Euler circuits and the interlace polynomial European Journal of Combinatorics | 2001-09-18 | Paper |
Polychromatic polynomials Discrete Mathematics | 2000-11-19 | Paper |
Spanning Subgraphs of Random Graphs Combinatorics, Probability and Computing | 2000-08-14 | Paper |
Constrainted graph processes The Electronic Journal of Combinatorics | 2000-04-16 | Paper |
Constrainted graph processes The Electronic Journal of Combinatorics | 2000-04-16 | Paper |
Closure and Hamiltonian-connectivity of claw-free graphs Discrete Mathematics | 1999-11-02 | Paper |
A Tutte Polynomial for Coloured Graphs Combinatorics, Probability and Computing | 1999-05-11 | Paper |
| Colorings generated by monotone properties | 1998-08-31 | Paper |
An Ordering on the Even Discrete Torus SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
On some conjectures of Graffiti Discrete Mathematics | 1998-05-06 | Paper |