Graphical sequences and plane trees
From MaRDI portal
Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Random walks on graphs (05C81) Lattice points in specified regions (11P21) Polyhedra and polytopes; regular figures, division of spaces (51M20) Infinitely divisible distributions; stable distributions (60E07) Sums of independent random variables; random walks (60G50)
Cites work
- A remark on the existence of finite graphs
- Basic number theory (in two parts). First part.
- Counting graphic sequences via integrated random walks
- Extreme degree sequences of simple graphs
- Functional Composition Patterns and Power Series Reversion
- Harmonic renewal measures
- scientific article; zbMATH DE number 3766767 (Why is no real title available?)
- scientific article; zbMATH DE number 17664 (Why is no real title available?)
- scientific article; zbMATH DE number 918811 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- scientific article; zbMATH DE number 3106649 (Why is no real title available?)
- Infinitely divisible sequences
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- The number of plane trees
- The polytope of degree sequences
- Tournament score sequences, Erdős-Ginzburg-Ziv numbers, and the Lévy-Khintchine method
This page was built for publication: Graphical sequences and plane trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303693)
