A note on highly connected and well-connected Ramsey theory

We study a pair of weakenings of the classical partition relation $ν\rightarrow (μ)^2_λ$ recently introduced by Bergfalk-Hrušák-Shelah and Bergfalk, respectively. Given an edge-coloring of the complete graph on $ν$-many vertices, these weakenings assert the existence of monochromatic subgraphs exhibiting high degrees of connectedness rather than the existence of complete monochromatic subgraphs asserted by the classical relations. As a result, versions of these weakenings can consistently hold at accessible cardinals where their classical analogues would necessarily fail. We prove some complementary positive and negative results indicating the effect of large cardinals, forcing axioms, and square principles on these partition relations. We also prove a consistency result indicating that a non-trivial instance of the stronger of these two partition relations can hold at the continuum.

No reviews yet.

No comments yet.