Common Contracts
2 similar Maximum Agreement contracts
On the Maximum Agreement Subtree Conjecture for Balanced TreesMaximum Agreement • May 18th, 2020
2h1 · 2h2−h1 = 2h2 distinct labels. Moreover, under this assignment of labels, L(Si) ∩ L(Tj) = Lr for some r ∈ {1, 2, . . . , 22h1 } (namely, the one that is placed in row i and column j). In particular, for all i and j, the pendant subtrees Si and Tj have exactly |Lr| = 2h2−h1 common labels.
On the Maximum Agreement Subtree Conjecture for Balanced TreesMaximum Agreement • May 15th, 2020
2h1 · 2h2−h1 = 2h2 distinct labels. Moreover, under this assignment of labels, L(Si) ∩ L(Tj) = Lr for some r ∈ {1, 2, . . . , 22h1 } (namely, the one that is placed in row i and column j). In particular, for all i and j, the pendant subtrees Si and Tj have exactly |Lr| = 2h2−h1 common labels.
