.png){kind=icon}
Return
Graphical sequences and plane trees
.png){kind=icon}
OA
AI
DOI：10.1017/S0963548325100345.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Balister, the second author, Groenland, Johnston, and Scott recently showed that there are asymptotically $C4<^>n/n<^>{3/4}$ many unordered sequences that occur as degree sequences of graphs with $n$ vertices. Combining limit theory for infinitely divisible distributions with a new 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 & eacute;vy-Khintchine formula. Our main result complements a result of Stanley, that ordered graphical sequences are related to quasi-forests.
Keywords:
asymptotic enumeration
degree sequence
graphical sequence
infinite divisibility
L & eacute
vy-Khintchine formula
random walk
renewal theory
Journal
C
IF:
0.8
Papers:
30
Citations:
0
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave no more