No CrossRef data available.
Published online by Cambridge University Press: 24 November 2023
An infinite graph is said to be highly connected if the induced subgraph on the complement of any set of vertices of smaller size is connected. We continue the study of weaker versions of Ramsey’s theorem on uncountable cardinals asserting that if we color edges of the complete graph, we can find a large highly connected monochromatic subgraph. In particular, several questions of Bergfalk, Hrušák, and Shelah (2021, Acta Mathematica Hungarica 163, 309–322) are answered by showing that assuming the consistency of suitable large cardinals, the following are relatively consistent with ZFC:
• $\kappa \to _{hc} (\kappa )^2_\omega $ for every regular cardinal
$\kappa \geq \aleph _2$,
• $\neg \mathsf {CH}+ \aleph _2 \to _{hc} (\aleph _1)^2_\omega $.
Building on a work of Lambie-Hanson (2023, Fundamenta Mathematicae. 260(2):181–197), we also show that
• $\aleph _2 \to _{hc} [\aleph _2]^2_{\omega ,2}$ is consistent with
$\neg \mathsf {CH}$.
To prove these results, we use the existence of ideals with strong combinatorial properties after collapsing suitable large cardinals.
Research of the first author was partially supported by a PAPIIT grant IN101323 and CONACyT grant A1-S-16164. Research of the second author was partially supported by the NSF grant DMS 1833363 and by the Israel Science Foundation (ISF) grant 1838/19. Research of the third author was supported by the European Research Council (Grant Agreement No. ERC-2018-StG 802756) and NSERC grants RGPIN-2019-04311, RGPIN-2021-03549, and RGPIN-2016-06541. The paper appears as number 1242 on the second author’s publications list.