Serte Donderwinkel

activity

20242026

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

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…

math.CO2025

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 $S_{n}$ of score sequences and the ErdÅs-Ginzburg-Ziv numbers $N_{n}$ fro…

math.CO2025

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 $C 4^{n} / n^{3/4}$ many unordered sequences that occur as degree sequences of g…

math.CO2024

Counting graphic sequences via integrated random walks

Paul Balister, Serte Donderwinkel, Carla Groenland +2

Given an integer $n$ , let $G (n)$ be the number of integer sequences $n - 1 \geq d_{1} \geq d_{2} \geq \dots \geq d_{n} \geq 0$ that are the degree sequence of some graph. We show that $G(n)=(c+o(1))…

math.CO2024

Refined Horton-Strahler numbers I: a discrete bijection

Louigi Addario-Berry, Marie Albenque, Serte Donderwinkel +1

The Horton-Strahler number of a rooted tree $T$ is the height of the tallest complete binary tree that can be homeomorphically embedded in $T$ . The number of full binary trees with…