## Shape of Tanglegrams

- Nov. 23, 2015
- 3:30 p.m.
- LeConte 312

## Abstract

A tanglegram consists of a pair of binary trees with the same number of leaves and a perfect matching between those leaves. The problem of enumerating tanglegrams (up to isomorphism) was recently solved by Billey, Konvalinka and Matsen. In this talk, we look at the shape of a randomly selected tanglegram - as it turns out, the two halves "essentially" look like two plane binary trees selected independently and uniformly at random.