40 citations · 172 across the 51 of their papers we have counts for
6 papers · 1 filter
The distribution of the number of automorphisms of random trees
Christoffer Olsson, Stephan Wagner
We study the size of the automorphism group of two different types of random trees: Galton--Watson trees and rooted Pólya trees. In both cases, we prove that it asymptotically foll…
The minimum number of maximal independent sets in twin-free graphs
Stijn Cambie, Stephan Wagner
The problem of determining the maximum number of maximal independent sets in certain graph classes dates back to a paper of Miller and Muller and a question of Erdős and Moser from…
Trees maximizing the number of almost-perfect matchings
Stijn Cambie, Bradley McCoy, Gunjan Sharma +2
We characterize the extremal trees that maximize the number of almost-perfect matchings, which are matchings covering all but one or two vertices, and those that maximize the numbe…
On the distribution of eigenvalues of increasing trees
Kenneth Dadedzi, Stephan Wagner
We prove that the multiplicity of a fixed eigenvalue in a random recursive tree on vertices satisfies a central limit theorem with mean and variance asymptotically equal to…
Refined enumeration of -plane trees and -noncrossing trees
Isaac Owino Okoth, Stephan Wagner
A -plane tree is a plane tree whose vertices are assigned labels between and in such a way that the sum of the labels along any edge is no greater than . These tree…
Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo
Clemens Heuberger, Sarah J. Selkirk, Stephan Wagner
For fixed non-negative integers , , and , with , a -Dyck path of length is a lattice path that starts at , ends at , stays weakly…