Skip to main content
. 2019 Dec 20;37(5):1480–1494. doi: 10.1093/molbev/msz305

Table 1.

The n-Taxon Species Trees with the Maximum Number of Rankings for a Labeled Topology.

n (,r) n (,r) n (,r) n (,r)
2 (1, 1) 18 (10, 8) 34 (18, 16) 50 (32, 18)
3 (2, 1) 19 (11, 8) 35 (19, 16) 51 (32, 19)
4 (2, 2) 20 (12, 8) 36 (20, 16) 52 (32, 20)
5 (3, 2) 21 (13, 8) 37 (21, 16) 53 (32, 21)
6 (4, 2) 22 (14, 8) 38 (22, 16) 54 (32, 22)
7 (4, 3) 23 (15, 8) 39 (23, 16) 55 (32, 23)
8 (4, 4) 24 (16, 8) 40 (24, 16) 56 (32, 24)
9 (5, 4) 25 (16, 9) 41 (25, 16) 57 (32, 25)
10 (6, 4) 26 (16, 10) 42 (26, 16) 58 (32, 26)
11 (7, 4) 27 (16, 11) 43 (27, 16) 59 (32, 27)
12 (8, 4) 28 (16, 12) 44 (28, 16) 60 (32, 28)
13 (8, 5) 29 (16, 13) 45 (29, 16) 61 (32, 29)
14 (8, 6) 30 (16, 14) 46 (30, 16) 62 (32, 30)
15 (8, 7) 31 (16, 15) 47 (31, 16) 63 (32, 31)
16 (8, 8) 32 (16, 16) 48 (32, 16) 64 (32, 32)
17 (9, 8) 33 (17, 16) 49 (32, 17) 65 (33, 32)

Note.—The tree with the maximum number of rankings splits into (left, right) subtrees with (,r) leaves. The n-taxon species tree with the maximum number of rankings Tn has 21+log2[(n1)/3] taxa descended from one side of the root and n21+log2[(n1)/3] from the other side.