Googology Wiki
Register
Advertisement
Googology Wiki

There are k labeled trees (T_1,T_2,...,T_k) with the following the following properties :

1.each tree (T_k) has at most k vertices of at most \(n\) types(from \(STREE(n)\) )

2.no tree is embedable in the following one wile at most removing n(from \(STREE(n)\) )+the number of nodes in the following tree

then \(STREE(n)\) is the largest set createable with the rules above

Advertisement