0-1 laws for pattern occurrences in phylogenetic trees and networks
0-1 laws for pattern occurrences in phylogenetic trees and networks
In a recent paper, the question of determining the fraction of binary trees that contain a fixed pattern known as the snowflake was posed. We show that this fraction goes to 1, providing two very different proofs: a purely combinatorial one that is quantitative and specific to this problem; and …