  In 1930, Ramsey proved that every infinite graph contains either an infinite
clique or an infinite independent set as an induced subgraph. K\"{o}nig proved
that every infinite graph contains either a ray or a vertex of infinite degree.
In this paper, we establish the 2-connected analog of these results.
