40 citations · 172 across the 51 of their papers we have counts for
6 papers · 1 filter
On the maximum mean subtree order of trees
Stijn Cambie, Stephan Wagner, Hua Wang
A subtree of a tree is any induced subgraph that is again a tree (i.e., connected). The mean subtree order of a tree is the average number of vertices of its subtrees. This invaria…
The birth of the strong components
Sergey Dovgal, Élie de Panafieu, Dimbinaina Ralaivaosaona +2
Random directed graphs undergo a phase transition around the point , and the width of the transition window has been known since the works of Luczak and Seierstad…
Extremal trees with fixed degree sequence
Eric O. D. Andriantiana, Valisoa Razanajatovo Misanantenaina, Stephan Wagner
The greedy tree and the -tree are known to be extremal among trees with degree sequence with respect to various graph invariants.…
Trees with minimum number of infima closed sets
Eric Ould Dadah Andriantiana, Stephan Wagner
Let be a rooted tree, and its set of vertices. A subset of is called an infima closed set of if for any two vertices , the first common ancestor…
Irrationality of growth constants associated with polynomial recursions
Stephan Wagner, Volker Ziegler
We consider integer sequences that satisfy a recursion of the form for some polynomial of degree . If such a sequence tends to infinity, then it satis…
On the Collection of Fringe Subtrees in Random Binary Trees
Louisa Seelbach Benkner, Stephan Wagner
A fringe subtree of a rooted tree is a subtree consisting of one of the nodes and all its descendants. In this paper, we are specifically interested in the number of non-isomorphic…