Pages that link to "Item:Q1380716"
From MaRDI portal
The following pages link to Combinatorial proof of the Prodinger formulas about binary trees (Q1380716):
Displaying 4 items.
- Combinatorial properties of triplet covers for binary trees (Q1637594) (← links)
- Projection heuristics for binary branchings between sum and product (Q2118310) (← links)
- Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees (Q2155503) (← links)
- On the number of vertices with a given degree in a Galton-Watson tree (Q4676435) (← links)