Stephan Wagner

Professor i matematik med inriktning mot sannolikhetsteori vid Matematiska institutionen; Akademisk personal

Telefon:: 018-471 32 88
E-post:: stephan.wagner@math.uu.se
Besöksadress:: Ångströmlaboratoriet, Regementsvägen 10
Postadress:: Box 480
751 06 UPPSALA

Ladda ned kontaktuppgifter för Stephan Wagner vid Matematiska institutionen; Akademisk personal

Professor i matematik med inriktning mot sannolikhetsteori vid Matematiska institutionen; Sannolikhetsteori och kombinatorik

E-post:: stephan.wagner@math.uu.se
Besöksadress:: Ångströmlaboratoriet, Regementsvägen 10
Postadress:: Box 480
751 06 UPPSALA

Ladda ned kontaktuppgifter för Stephan Wagner vid Matematiska institutionen; Sannolikhetsteori och kombinatorik

Kort presentation

Mina forskningsintressen är främst diskret matematik, särskilt kombinatorisk sannolikhet (slumpmässiga träd, slumpmässiga grafer och andra slumpmässiga strukturer), enumerativ och analytisk kombinatorik och grafteori.

Biografi

2000 - 2006 Studier i matematik vid TU Graz, Österrike

2007 - 2019 Department of Mathematical Sciences, Stellenbosch University, Sydafrika

2020 - nuvarande Matematiska institutionen, Uppsala Universitet

Forskning

Senaste publicationer och preprints:

2020

2021

Irrationality of growth constants associated with polynomial recursions, Journal of Integer Sequences 24/1 (2021), article 21.1.6 (9 pages); with V. Ziegler.
Extremal trees with fixed degree sequence, Electronic Journal of Combinatorics 28/1 (2021), P 1.1 (34 pages); with E. O. D. Andriantiana and V. Razanajatovo Misanantenaina.
On the maximum mean subtree order of trees, European Journal of Combinatorics 97 (2021), 103388 (19 pages); with S. Cambie and H. Wang. Preprint: [pdf]
Further results on the inducibility of d-ary trees. Australasian Journal of Combinatorics 81 (2021), 1-24; with A. A. V. Dossou-Olory.
On the probability that a random subtree is spanning. Journal of Graph Theory 98/2 (2021), 195-215. Preprint: [pdf]

2022

Trees with minimum number of infima closed sets. Discrete Mathematics 345/5 (2022), 112793 (20 pages); with E. O. D. Andriantiana. Preprint: [pdf]
Trees in Many Contexts. Notices of the American Mathematical Society 69/2 (2022), 284-286; with H. Smith Blake, M. Bóna, E. Czabarka and H. Wang.
Steiner Wiener index and line graphs of trees. Discrete Mathematics Letters (special issue dedicated to the memory of Nenad Trinajstić) 9 (2022), 86-91; with M. Kovše and V. Razanajatovo Misanantenaina.
A polynomial associated with rooted trees and specific posets, Transactions on Combinatorics 11/3 (2022), 255-279; with V. Razanajatovo Misanantenaina.
Uncovering a random tree. 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Art. No. 10, 17 pp., LIPIcs. Leibniz Int. Proc. Inform., 225; with B. Hackl and A. Panholzer.
Automorphisms of random trees. 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Art. No. 16, 16 pp., LIPIcs. Leibniz Int. Proc. Inform., 225; with C. Olsson.
Maximum number of subtrees in cacti and block graphs. Aequationes Math. 96/5 (2022), 1027-1040; with J. Li, K. Xu, T. Zhang and H. Wang.
Gini index on generalized r-partitions. Math. Slovaca 72/5 (2022), 1129-1144; with T. Mansour, M. Schork and M. Shattuck.
Distinct Fringe Subtrees in Random Trees, Algorithmica 84 (2022), no. 12, 3686–3728 ; with L. Seelbach Benkner. Preprint: [pdf]

2023

On the mean subtree order of trees under edge contraction, Journal of Graph Theory 102/3 (2023), 535-551; with Z. Luo, K. Xu and H. Wang.
Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo k. Electronic Journal of Combinatorics 30/1 (2023), P1.26 (18 pages); with C. Heuberger and S. J. Selkirk.

Accepted

Broadcasting induced colourings of random recursive trees and preferential attachment trees, to appear in Random Structures & Algorithms; with C. Desmarais and C. Holmgren. Preprint: [pdf]
Refined enumeration of k-plane trees and k-noncrossing trees, to appear in Annals of Combinatorics; with I. O. Okoth. Preprint: [pdf]

Preprints

Limits of subcritical random graphs and random graphs with excluded minors; with A. Georgakopoulos. Preprint: [pdf]
The birth of the strong components; with É. de Panafieu, S. Dovgal, D. Ralaivaosaona and V. Rasendrahasina. Preprint: [pdf]
Convex characters, algorithms and matchings; with S. Kelk and R. Meuwese. Preprint: [pdf]
Average Case Analysis of Leaf-Centric Binary Tree Sources; with M. Lohrey and L. Seelbach Benkner. Preprint: [pdf]
On the distribution of eigenvalues of increasing trees; with K. Dadedzi. Preprint: [pdf]
Trees maximizing the number of almost-perfect matchings; with S. Cambie, B. McCoy, G. Sharma and C. Yap. Preprint: [pdf]
The minimum number of maximal independent sets in twin-free graphs; with S. Cambie. Preprint: [pdf]
The distribution of the number of automorphisms of random trees; with C. Olsson. Preprint: [pdf]
Conditioned Galton-Watson trees: The shape functional, and more on the sum of powers of subtree sizes; with J. A. Fill and S. Janson. Preprint: [pdf]
The Uncover Process for Random Labeled Trees; with B. Hackl and A. Panholzer. Preprint: [pdf]