More Ramsey theory for highly connected monochromatic subgraphs
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 any set of vertices of smaller size is connected. We continue the study of weaker versions …
A note on highly connected and well-connected Ramsey theory
C Lambie-Hanson - arxiv preprint arxiv:2005.10812, 2020 - arxiv.org
We study a pair of weakenings of the classical partition relation $\nu\rightarrow (\mu)^
2_\lambda $ recently introduced by Bergfalk-Hru\v {s}\'{a} k-Shelah and Bergfalk …
2_\lambda $ recently introduced by Bergfalk-Hru\v {s}\'{a} k-Shelah and Bergfalk …