A note on highly connected and well-connected Ramsey theory

DOI10.4064/FM141-9-2022arXiv2005.10812MaRDI QIDQ6044552FDOQ6044552

Chris Lambie-Hanson

Publication date: 19 May 2023

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

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.

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

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
• 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

zbMATH Keywords

highly connectedpartition relationssquare principlesguessing modelswell-connected

Mathematics Subject Classification ID

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

Cites Work

• Squares, scales and stationary reflection
• A partition calculus in set theory
• Title not available (Why is that?)
• Aronszajn trees and the independence of the transfer property
• Guessing models and generalized Laver diamond
• On the consistency strength of the proper forcing axiom
• PFA and guessing models
• SQUARES AND NARROW SYSTEMS
• Ramsey theory for highly connected monochromatic subgraphs
• Title not available (Why is that?)
• Ramsey theory for monochromatically well-connected subsets
• Aronszajn trees, square principles, and stationary reflection
• SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS

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)