Kruskal's tree theorem

English

Etymology

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

Proper noun

Kruskal's tree theorem

1. (mathematics) 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.

See also

• TREE