Stephan Wagner

most citedA bijection for the evolution of

B

-trees

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2025

On the intersection of pairs of trees

Miklos Bona, Fabian Burghart, Stephan Wagner

We consider the number of common edges in two independent random spanning trees of a graph $G$ . For complete graphs $K_{n}$ , we give a new proof of the fact, originally obtained by M…

math.CO2024★ 1 cited

A bijection for the evolution of $B$ -trees

Fabian Burghart, Stephan Wagner

A $B$ -tree is a type of search tree where every node (except possibly for the root) contains between $m$ and $2 m$ keys for some positive integer $m$ , and all leaves have the same d…

On the intersection of pairs of trees

A bijection for the evolution of B-trees

A bijection for the evolution of $B$ -trees