106 citations · 431 across the 57 of their papers we have counts for
9 papers · 1 filter
Diameters and mixing times for giant components of random graphs with given degrees
Louigi Addario-Berry, Bruce Reed, Corrine Yap
A sequence is a feasible degree sequence if there is a graph on such that has degree . For such a sequence, is a graph chosen uni…
Infinite Schnyder Woods
Louigi Addario-Berry, Emma Hogan, Lukas Michel +1
It is well-known that any finite triangulation possesses a unique maximal Schnyder wood. We introduce Schnyder woods of infinite triangulations, and prove there exists a unique max…
Refined Horton-Strahler numbers I: a discrete bijection
Louigi Addario-Berry, Marie Albenque, Serte Donderwinkel +1
The Horton-Strahler number of a rooted tree is the height of the tallest complete binary tree that can be homeomorphically embedded in . The number of full binary trees with…
The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
Louigi Addario-Berry, Serte Donderwinkel, Mickaël Maazoun +1
We present a very simple bijective proof of Cayley's formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we ex…
High degrees of random recursive trees
Louigi Addario-Berry, Laura Eslava
For , let be a random recursive tree on the vertex set . Let be the degree of vertex in , that is, the number of…
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…