Kruskal's tree theorem

Kruskal's tree theorem is a result in graph theory and combinatorics that deals with the structure of trees and their embeddings within each other. More specifically, it provides criteria for the comparison and embedding of trees.