A note on highly connected and well-connected Ramsey theory

DOI10.4064/FM141-9-2022MaRDI QIDQ6044552zbMATH OpenFDO

Authors Chris Lambie-Hanson

Publication date 19 May 2023

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.10812

zbMATH Keywords

guessing modelshighly connectedpartition relationssquare principleswell-connected

Mathematics Subject Classification ID

Partition relations (03E02) Consistency and independence results (03E35) Infinite graphs (05C63)

Abstract: We study a pair of weakenings of the classical partition relation $uightarrow(mu{)}_l^{2}ambda$ recently introduced by Bergfalk-Hruv{s}'{a}k-Shelah and Bergfalk, respectively. Given an edge-coloring of the complete graph on $u$-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.

Recommendations

• Ramsey theory for highly connected monochromatic subgraphs
• Ramsey theory for monochromatically well-connected subsets
• On the connectivity of extremal Ramsey graphs
• On highly ramsey infinite graphs
• A note on the Erdős-Hajnal hypergraph Ramsey problem
• scientific article; zbMATH DE number 4213982
• A note on regular Ramsey graphs
• A note on Ramsey numbers for Berge-\(G\) hypergraphs
• A generalization of a Ramsey‐type theorem on hypermatchings
• Note on a Ramsey-Turán type problem

Cites work

• A partition calculus in set theory
• Aronszajn trees and the independence of the transfer property
• Aronszajn trees, square principles, and stationary reflection
• Guessing models and generalized Laver diamond
• scientific article; zbMATH DE number 3972851 (Why is no real title available?)
• scientific article; zbMATH DE number 1908324 (Why is no real title available?)
• On the consistency strength of the proper forcing axiom
• PFA and guessing models
• Ramsey theory for highly connected monochromatic subgraphs
• Ramsey theory for monochromatically well-connected subsets
• Squares and narrow systems
• SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
• Squares, scales and stationary reflection

Cited in

(2)

• Ramsey theory for monochromatically well-connected subsets
• More Ramsey theory for highly connected monochromatic subgraphs

This page was built for publication: A note on highly connected and well-connected Ramsey theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6044552)