Supersolvable LL-lattices of binary trees

Riccardo Biagioli, Frédéric Chapoton
2005 Discrete Mathematics  
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
doi:10.1016/j.disc.2005.03.005 fatcat:tpcwygoibrg5nbpzy5rezv4jba