Bounds on the Expected Size of the Maximum Agreement Subtree
  We prove polynomial upper and lower bounds on the expected size of the maximum agreement subtree of two random binary phylogenetic trees under both the uniform distribution and Yule-Harding distribution. This positively answers a question posed in earlier work. Determining tight upper and lower bounds remains an open problem. 
Daniel Irving Bernstein, Lam Si Tung Ho, Colby Long, Mike Steel,   Katherine St. John, Seth Sullivant
q-bio.PE cs.DS