1 paper
Jeffrey Bergfalk, Michael Hrušák, Saharon Shelah
An infinite graph is highly connected if the complement of any subgraph of smaller size is connected. We consider weaker versions of Ramsey's Theorem asserting that in any coloring…