Sampling planar tanglegrams and pairs of disjoint triangulations

Alexander E. Black, Kevin Liu, Alex Mcdonough +4

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that th…