Texte intégral
Exercice given at the end of Leure.
By definition, a finite tree t is binary if every vertex u ∈ t has either , or children. Find the generation funion of binary trees with nvertices and the number of binary trees with n vertices.
Hint. Since there are no binary trees with an even number of vertices, it would perhaps be useful to consider inead binary trees withkleaves (a leaf being a vertex without a child).
Documents relatifs
We use our result to prove that the scaling limit of finite variance Galton–Watson trees conditioned on the number of nodes whose out-degree lies in a given set is the
If the addition of the n-th vertex does not increase the number of leaves, we know that at time sn the random walk resides on a vertex which has only two neighbours; a parent and a
and taking into account that the order of the first k vertices is not relevant and that there are 2k initial cliques giving rise to the same graph, it follows that the number
