The number of topological types of trees

Two graphs are of the same topological type if they can be mutually embedded into each other topologically. We show that there are exactly $\aleph_1$ distinct topological types of countable trees. In general, for any infinite cardinal $\kappa$ there are exactly $\kappa^+$ distinct topological types of trees of size $\kappa$. This solves a problem of van der Holst from 2005.


Introduction
A graph-theoretic tree T is a topological minor of another tree S, written T ≤ S, if some subdivision of T embeds as a subgraph into S. Nash-Williams [11] proved in 1965 the seminal result that the class of graph-theoretic trees is well-quasi-ordered under ≤, i.e. that it is a reflexive and transitive relation without infinite strictly decreasing sequences or infinite antichains.However, this embedding relation ≤ is not anti-symmetric: Two distinct trees T and S may well be topological minors of each other, i.e.T ≤ S and S ≤ T .In this case, we say they are of the same topological type, written T ≡ S. Describing the hierarchy of graph-theoretic trees under the quasi-ordering ≤ means understanding the partial order that ≤ induces on the topological types of trees.By Nash-Williams's theorem, this is a wellpartial-order.But determining its most fundamental characteristic, namely its cardinality, has been an open problem until now.
Indeed, while up to isomorphism there are exactly 2 ℵ 0 countable trees, determining the exact number of topological types of countable trees is an open problem posed by van der Holst in 2005 (see [10]).Building on the trees in Figure 1, we get examples of 2 ℵ 0 non-isomorphic trees of the same topological type.So a priori, it would have been conceivable that there are only countably many topological types of countable trees.However, Matthiesen [10] showed in 2006, by an indirect proof building on Nash-Williams's theorem, that there are uncountably many topological types of countable trees.Bruno [2] in 2017 gave an explicit construction of uncountably many topological types of subtrees of the binary tree.Recently, Bruno and Szeptycki [3] gave the first indication that this bound could be sharp by establishing that there are exactly ℵ 1 many topological types of locally finite trees with only countably many rays.
Our main result confirms this pattern for all trees and all cardinalities: Theorem.For any infinite cardinal κ there are exactly κ + distinct topological types of trees of size κ.
Our proof uses a new rank function for trees inspired by Nash-Williams's work on the better-quasi-ordering of infinite trees.

The lower bound
For common concepts in graph theory and set theory see the textbooks by Diestel [4] and Jech [7].We write κ + for the successor cardinal of κ, and α + 1 for the successor ordinal of α.
We recall Schmidt's rank function for rayless graphs [13], see also [6] for an English account: We say that a graph G has rank 0 if G is finite.Given an ordinal α > 0, we assign rank α to G if G does not already have a rank < α and there exists a finite set of vertices X in G such that all components of G − X have a rank < α.Schmidt  We can now give the argument for the lower bound in our main theorem: Lemma 2.2.For any infinite cardinal κ there are at least κ + distinct topological types of (rayless) trees of size κ.
Proof.We show that for all ordinals 0 < α < κ + , there exists a rayless tree T α of size κ and rank α.Then it follows from Lemma 2.1 that all T α belong to different topological types, establishing the assertion of the lemma.
We construct the T α by recursion on α, beginning with T 1 as the κ-star.For successor steps, take countably many disjoint copies T n (n ∈ N) of T α and obtain T α+1 by adding a new vertex v to n∈N T n and connecting it to the root of every T n .Then deleting {v} witnesses that T α+1 has rank at most α + 1.On the other hand, every finite set of vertices X of T α+1 avoids infinitely many copies of T α , so there are components of T α+1 − X containing copies of T α .Every such component has rank at least α by Lemma 2.1, showing that T α+1 has rank at least α + 1.
For limit steps, obtain T ℓ by adding a new vertex v to α<ℓ T α and connecting it to the root of every T α for α < ℓ.Then deleting {v} witnesses that T ℓ has rank at most ℓ; on the other hand, every finite set of vertices X of T ℓ avoids almost all T α copies for α < ℓ, so T ℓ − X contains components of arbitrarily large rank below ℓ by Lemma 2.1, showing that T ℓ has rank at least ℓ.□

Better-quasi-orderings
A quasi-ordering is a binary relation that is reflexive and transitive.A quasi-ordering ≤ on set Q is a well-quasi-ordering if for every sequence q 1 , q 2 , q 3 , . . . of elements in Q there are indices n < m ∈ N such that q n ≤ q m .We define an equivalence relation ≡ on Q by q ≡ q ′ if both q ≤ q ′ and q ′ ≤ q.We abbreviate |Q| ≡ := |Q/≡|.
Let Q be quasi-ordered and κ an infinite cardinal.We say that q ∈ Q is κ-embeddable in Q if there exist at least κ many elements q ′ ∈ Q with q ≤ q ′ .We need the following routine result, a proof of which can be found e.g. in [1, Lemma 3.3]: Lemma 3.1.For any well-quasi-order Q and infinite cardinal κ, the number of elements of Q which are not κ-embeddable in Q is less than κ.□ Let (Q, ≤ Q ) be a quasi-order.Following Nash-Williams [11], we consider the quasi-ordering on the power set P(Q) where for A, B ⊆ Q we have A ≤ B if there is an injective function f : A → B such that a ≤ Q f (a) for all a ∈ A.
Recall that P(Q) is not necessarily well-quasi-ordered if Q is well-quasiordered (see [12]).This is remedied by the introduction of the concept of a better-quasi-ordering.We shall not define this concept precisely; we only use as a blackbox that every better-quasi-ordered set is also well-quasi-ordered, that P(Q) is better-quasi-ordered if Q is better-quasi-ordered, and that the class of all trees is better-quasi-ordered under the topological minor relation [11] (also see [9], [8]).
We write P κ (Q) for the set of subsets of Q of size exactly κ and P ≤κ (Q) for the set of subsets of Q of size at most κ.Extending an idea from [3], we prove the following result on the number of equivalence classes in P κ (Q):  [11,Corollary 28A].So the partial order P κ (Q)/ ≡ contains no infinite antichains and thus contains a chain of size µ + .Since P κ (Q)/ ≡ is well-founded, this chain is well-ordered.Hence, there is strictly increasing chain A = (A k : k < µ + ) in P κ (Q).
By applying Lemma 3.1 to each induced suborder (A k , ≤) of (Q, ≤ Q ), we obtain for every there are at most µ different possible cardinalities for the sets X k .Since µ + is regular, we may assume without loss of generality that |X k | = ν for all k < µ + and some cardinal ν < κ.Furthermore, we may assume that all sets X k for k < µ + are pairwise equivalent with respect to Next, let {q ℓ : ℓ < µ} be a representation system for the equivalence classes of Q/≡.For every q ℓ that is κ-embeddable in some A ∈ A, we pick a suitable A k(ℓ) ∈ A witnessing this.Let k * := sup {k(ℓ) : ℓ < µ} < µ + .We arrive at the desired contradiction once we have proved that for all k > k * .For this, we need an injective function f : and suppose that f has been defined on a j for all j < i.
from all values of f that have already been defined.We set f (a i ) := b, which completes the construction of f .□ Corollary 3.3.Let µ be an infinite cardinal and Q a better-quasi-ordered set with Proof.Since κ < ℵ µ + , there exist at most µ cardinals ≤ κ.Hence |P ≤κ (Q)| ≡ ≤ µ * µ = µ by Theorem 3.2 applied to P ν (Q) for all cardinals ν ≤ κ. □

The upper bound
We consider rooted, graph theoretic trees and tree-order preserving topological minors.For this, we introduce a minimal amount of notation, cf.[4, §12.2].Recall that fixing a root r of a graph-theoretic tree T yields a natural treeorder ≤ r on T where t ≤ r s if t lies on the unique path from r to s in T .Given a rooted tree, write ⌊t⌋ for the subtree of T induced by the set {t ′ ∈ T : t ≤ r t ′ } with root t.The neighbours of t in ⌊t⌋ are the successors of t, denoted by the set succ(t).Given rooted trees T and S, we write T ≤ S if there exists a topological minor embedding φ : T → S that preserves the tree-order: If x ≤ y in T then φ(x) ≤ φ(y) in S.
We now introduce a new rank function inspired by the proof methods of the better-quasi-ordering of trees due to Nash-Williams: Definition 4.1.We say that a tree T has rank 0 if ⌊t⌋ ≡ T holds for all t ∈ T .Given an ordinal α > 0, we assign rank α to T if T does not already have a rank < α and for all t ∈ T , we have either ⌊t⌋ ≡ T or ⌊t⌋ has rank < α.We also write rank(T ) for the rank of T .Lemma 4.2.Every tree of size at most κ has a rank < κ + .
Proof.Suppose for a contradiction that there is a tree in T which does not have a rank < κ + .Since rooted trees are well-quasi-ordered under ≤ by Nash-Williams's theorem [11], there exists a ≤-minimal such tree T .Then for every t ∈ T with ⌊t⌋ ̸ ≡ T we have rank(⌊t⌋) < κ + by minimality of T .However, the rank of T is at most sup{rank(⌊t⌋) : t ∈ T, ⌊t⌋ ̸ ≡ T } + 1, which is an ordinal < κ + since |T | ≤ κ.This contradicts the choice of T .□ For the remainder of this section, let κ be a fixed infinite cardinal.We write T for the class of rooted trees of size at most κ, and C for the set of cardinals of size at most κ.
Given two quasi-orderings (Q, ≤) and (R, ≤), we define a quasi-ordering on Q × R by letting (q, r) ≤ (q ′ , r ′ ) if q ≤ q ′ and r ≤ r ′ .Together with the quasi-ordering on P(Q) defined in Section 3, this yields a quasi-ordering on the set P ≤κ (C × P ≤κ (T )) considered in the definition of Θ(T ) above.Nash-Williams showed in [11,Lemma 29]: Proof.For all ordinals α < κ + , we write T α for the class of all trees of size at most κ and rank α and T <α for the class of all trees of size at most κ and rank < α.We show by induction on α that |T α | ≡ ≤ κ holds for all α < κ + .Then it follows from Lemma 4.

Figure 1 .
Figure 1.Distinct trees of the same topological type.

Lemma 4 . 3 .Theorem 4 . 4 .
For all rooted trees with Θ(T ) ≤ Θ(S), we have T ≤ S. □ Finally, we give the argument for the upper bound in our main theorem, in a stronger version for rooted trees: For any infinite cardinal κ there are at most κ + distinct topological types of rooted trees of size κ.