Kruskal's tree theorem

短语

释义与例句

name
  1. 1.

    A theorem stating that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding.

    数学

词源

The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960).

来源：wiktionary