Kruskal's tree theorem
Well-quasi-ordering of finite trees / From Wikipedia, the free encyclopedia
In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding.
![]() | This article may be too technical for most readers to understand. (June 2024) |