106 citations · 431 across the 57 of their papers we have counts for
4 papers · 1 filter
Cutting down trees with a Markov chainsaw
Louigi Addario-Berry, Nicolas Broutin, Cecilia Holmgren
We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution,…
Connectivity for bridge-addable monotone graph classes
Louigi Addario Berry, Colin McDiarmid, Bruce Reed
A class A of labelled graphs is bridge-addable if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between…
Tail bounds for the height and width of a random tree with a given degree sequence
Louigi Addario-Berry
Fix a sequence c=(c_1,...,c_n) of non-negative integers with sum n-1. We say a rooted tree T has child sequence c if it is possible to order the nodes of T as v_1,...,v_n so that f…
Subgraphs of 4-regular planar graphs
Chris Dowden, Louigi Addario-Berry
We shall present an algorithm for determining whether or not a given planar graph H can ever be a subgraph of a 4-regular planar graph. The algorithm has running time O(|H|^{2.5})…