Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02956809n
Noun Named Entity
Categories: Wellfoundedness, Theorems in discrete mathematics, Mathematical logic, Articles with short description, Order theory
EN
Kruskal's tree theorem  TREE  Kruskal's theorem  Kruskal theorem  Kruskal tree theorem
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
Mathematical sentence Wikidata
IS A
theorem
NAMED AFTER
Joseph Kruskal
PROVED BY
Joseph Kruskal
Wikipedia
EN
Kruskal's tree theorem
Wikidata
EN
Kruskal's tree theorem
Wikipedia Redirections
EN
Kruskal's theorem, Kruskal's Tree Theorem, Kruskal theorem, Kruskal tree theorem, TREE, tree function

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License