Countable \(\alpha\)-extendable graphs (Q5946747)

For \(G\) a countable graph, Nash-Williams defined inductively an \(n\)-path in \(G\) as follows: A 0-path is a finite path in \(G\) and an \((n+1)\)-path is a finite path \(P\) such that, for every finite subset \(F\) of vertices of \(G\), \(P\) can be extended to an \(n\)-path containing \(F\). He showed that there is a countable non-Hamiltonian graph with vertices of infinite degree, which contains an \(n\)-path for every positive integer \(n\). In this paper, the authors extend the above definition to an \(\alpha\)-path, where \(\alpha\) is an ordinal. They construct, for any countable ordinal \(\alpha\), a non-Hamiltonian countable \(\alpha\)-extendable graph of vertex degree at most 4.