A note on highly connected and well-connected Ramsey theory

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

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

highly connectedpartition relationssquare principlesguessing modelswell-connected

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Guessing models and generalized Laver diamond
• PFA and guessing models
• On the consistency strength of the proper forcing axiom
• Ramsey theory for highly connected monochromatic subgraphs
• SQUARES, SCALES AND STATIONARY REFLECTION
• A partition calculus in set theory
• SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
• Aronszajn trees, square principles, and stationary reflection
• Ramsey theory for monochromatically well-connected subsets
• SQUARES AND NARROW SYSTEMS
• Aronszajn trees and the independence of the transfer property

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