On planes trees with a prescribed number of valency set realizations
Fundamentalʹnaâ i prikladnaâ matematika, Tome 13 (2007) no. 6, pp. 9-17
Cet article a éte moissonné depuis la source Math-Net.Ru
We describe valency sets of plane bicolored trees with a prescribed number of realizations by plane trees. Three special types of plane trees are defined: chains, trees of diameter 4, and special trees of diameter 6. We prove that there is a finite number of valency sets that have $R$ realizations as plane trees and do not belong to these special types. The number of edges of such trees is less than or equal to $12R+2$. The complete lists of valency sets of plane bicolored trees with 1, 2, or 3 realizations are presented.
@article{FPM_2007_13_6_a1,
author = {N. M. Adrianov},
title = {On planes trees with a~prescribed number of valency set realizations},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {9--17},
year = {2007},
volume = {13},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2007_13_6_a1/}
}
N. M. Adrianov. On planes trees with a prescribed number of valency set realizations. Fundamentalʹnaâ i prikladnaâ matematika, Tome 13 (2007) no. 6, pp. 9-17. http://geodesic.mathdoc.fr/item/FPM_2007_13_6_a1/
[1] Schneps L., “Dessins d'enfants on the Riemann sphere”, The Grothendieck Theory of Dessins d'Enfants, London Math. Soc. Lect. Note Ser., 200, ed. L. Schneps, Cambridge University Press, Cambridge, 1994, 47–78 | MR
[2] Shabat G., “On the classification of plane trees by their Galois orbit”, The Grothendieck Theory of Dessins d'Enfants, London Math. Soc. Lect. Note Ser., 200, ed. L. Schneps, Cambridge University Press, Cambridge, 1994, 169–177 | MR | Zbl
[3] Tutte W. T., “Planted plane trees with a given partition”, Amer. Math. Monthly, 71:3 (1964), 272–277 | DOI | MR | Zbl