Let $G$ be a graph (of any cardinality). Suppose all its vertices have finite degree. Then does there exist an infinite non-self-intersecting path of an infinite sequence of vertices in $G$?
If not, then is it true if the supremum of the degrees in $G$ is finite?
I am comfortable assuming that $G$ is a tree.