Unavoidable Induced Subgraph of Infinite 2-connected Graphs

In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. Kö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.