Tag: NicolaLorenz

A rooted spanning tree of a graph $G$ is called normal if the endvertices of all edges of $G$ are comparable in the tree order. It is well known that every finite connected graph has a normal spanning tree (also known as depth-first search tree). Also, all countable graphs have normal spanning trees, but uncountable complete graphs for example do not. In 2021, Pitz proved the following characterisation for graphs with normal spanning trees, which had been conjectured by Halin: A connected graph $G$ has a normal spanning tree if and only if every minor of $G$ has countable colouring number, i.e. there is a well-order of the vertices such that every vertex is preceded by only finitely many of its neighbours.

More generally, a not necessarily spanning tree in $G$ is called normal if for every path $P$ in $G$ with both endvertices in $T$ but no inner vertices in $T$, the endvertices of $P$ are comparable in the tree order. We establish a local version of Pitz’s theorem by characterising for which sets $U$ of vertices of $G$ there is a normal tree in $G$ covering $U$. The results are joint work with Max Pitz.