Question: If graphs are allowed to have an infinite number of vertices and edges, then Lemma is false. Give a counter example that shows this. In other words, give an example of an "infinite tree" (a connected, circuit-free graph with an infinite number of vertices and edges) that has no vertex of degree 1.
Lemma: Any tree that has more than one vertex has at least one vertex of degree 1.