Kruskal's tree theorem
Well-quasi-ordering of finite trees / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Kruskal's tree theorem?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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.