oh mae oh ma, mo shinderu. NANI!?!?!? tree 3 in minesweeper? WAIT WHA- [insert universe exploding] The nth tree in the sequence contains at most n vertices, and no tree is inf-embeddable within any later tree in the sequence. TREE(3) is defined to be the longest possible length of such a sequence. so tree 1 = 1 tree 2 = 6 BUT TREE 3 IS MORE THAN G(G(100))
