If graphs are allowed to have an infinite number of vertices and edges, then Lemma
Chapter 10, Problem 6(choose chapter or problem)
If graphs are allowed to have an infinite number of vertices and edges, then Lemma 10.5.1 is false. Give a counterexample 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.Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer