Start with any vertex "v"1. Every one of the infinitely many vertices of "G" can be reached from "v"1 with a simple path, and each such path must start with one of the finitely many vertices adjacent to "v"1. There must be one of those adjacent vertices through which infinitely many vertices can be reached without going through "v"1. If there were not, then the entire graph would be the union of finitely many finite sets, and thus finite, contradicting the assumption that the graph is infinite. We may thus pick one of these vertices and call it "v"2.