User talk:Hanchao090806

I know how large is TREE(3) and TREE(n) is the length of a longest sequence of n-labelled trees T1,...,Tm in which each Ti has at most i vertices, and no tree is embeddable into a later tree.I think that all of n to TREE(n) are exist.And I want to know how large is TREE(4).

August 2012
Hello, I'm Tgeairn. This might not have been intentional, but I noticed that you recently removed some content from Talk:Kruskal's tree theorem without explaining why. In the future, it would be helpful to others if you described your changes to Wikipedia with an edit summary. If you think I made a mistake, or if you have any questions, you can leave me a message on my talk page. Thanks, Tgeairn (talk) 04:27, 19 August 2012 (UTC)