In 1930, Ramsey proved that for every positive integer $r$, every sufficiently large graph contains as an induced subgraph either $K_r$ or an independent set of size $r$. In this talk, I will give analogous characterizations for increasing levels of connectivity. This presentation combines work from two projects: the first with Guoli Ding and Bogdan Oporowski, and the second with Mark Ellingham.