Geodesic
Unbalanced Subtrees in Binary Rooted Ordered and Un-ordered Trees
Séminaire lotharingien de combinatoire, Tome 68 (2012-2013)

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

Binary rooted trees, both in the ordered and in the un-ordered case, are well studied structures in the field of combinatorics. The aim of this work is to study particular patterns in these classes of trees. We consider completely unbalanced subtrees, where unbalancing is measured according to the so-called Colless index. The size of the biggest unbalanced subtree becomes then a new parameter with respect to which we find several enumeration formulas. 

@article{SLC_2012-2013_68_a1,
     author = {Filippo Disanto},
     title = {Unbalanced {Subtrees} in {Binary} {Rooted} {Ordered} and {Un-ordered} {Trees}},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {68},
     year = {2012-2013},
     url = {http://geodesic.mathdoc.fr/item/SLC_2012-2013_68_a1/}
}
TY  - JOUR
AU  - Filippo Disanto
TI  - Unbalanced Subtrees in Binary Rooted Ordered and Un-ordered Trees
JO  - Séminaire lotharingien de combinatoire
PY  - 2012-2013
VL  - 68
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SLC_2012-2013_68_a1/
ID  - SLC_2012-2013_68_a1
ER  - 
%0 Journal Article
%A Filippo Disanto
%T Unbalanced Subtrees in Binary Rooted Ordered and Un-ordered Trees
%J Séminaire lotharingien de combinatoire
%D 2012-2013
%V 68
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SLC_2012-2013_68_a1/
%F SLC_2012-2013_68_a1
Filippo Disanto. Unbalanced Subtrees in Binary Rooted Ordered and Un-ordered Trees. Séminaire lotharingien de combinatoire, Tome 68 (2012-2013). http://geodesic.mathdoc.fr/item/SLC_2012-2013_68_a1/