3 citations · 6 across the 21 of their papers we have counts for
6 papers · 1 filter
The number and structure of connected graphs with a fixed degree sequence
Sasha Bell, Serte Donderwinkel, Remco van der Hofstad
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configur…
Tournament score sequences, Erdős-Ginzburg-Ziv numbers, and the Lévy-Khintchine method
Michal Bassan, Serte Donderwinkel, Brett Kolesnik
We give a short proof of a recent result of Claesson, Dukes, Franklín and Stefánsson, connecting the number of score sequences and the Erdős-Ginzburg-Ziv numbers from a…
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…
Graphical sequences and plane trees
Michal Bassan, Serte Donderwinkel, Brett Kolesnik
Balister, the second author, Groenland, Johnston and Scott recently showed that there are asymptotically many unordered sequences that occur as degree sequences of g…
Counting graphic sequences via integrated random walks
Paul Balister, Serte Donderwinkel, Carla Groenland +2
Given an integer , let be the number of integer sequences that are the degree sequence of some graph. We show that $G(n)=(c+o(1))…
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…