Graphical sequences and plane trees

Abstract

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 graphs. Combining limit theory for infinitely divisible distributions with a new bijective connection between a class of random walk trajectories and a subset counting formula from additive number theory, we describe $C$ in terms of Walkup's number of rooted plane trees. The bijection is related to an instance of the Lévy-Khintchine formula. Our main result complements a result of Stanley, that ordered graphical sequences are related to quasi-forests.

v2: minor edits