The article discusses Kruskal's tree theorem, which states that in an infinite sequence of finite trees, there always exists a subtree that is a part of a larger tree. Joseph Kruskal proved this theorem using second-order logic, while Harvey Friedman narrowed down the problem to trees with a certain number of vertices. The article provides a brief overview of the theorem and its proof, as well as some background information on mathematical graphs and infinite sets.