Ramsey-Theory and Forcing Extensions

DOI10.2307/2160385MaRDI QIDQ4299246zbMATH OpenOpenAlexFDO

Authors Péter Komjáth

Publication date 7 November 1994

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2160385

zbMATH Keywords

Ramsey theory of graphsset forcing

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Generalized Ramsey theory (05C55)

Recommendations

• scientific article; zbMATH DE number 1083161
• A strongly non-Ramsey order type
• Two remarks on Ramsey's theorem
• Indestructible colourings and rainbow Ramsey theorems
• Generic graph construction

Cited in

(6)

• Superfilters, Ramsey theory, and van der Waerden's theorem
• Forcing with filters and complete combinatorics
• A forcing notion related to Hindman's theorem
• Monochromatic sumset without large cardinals
• Indestructible colourings and rainbow Ramsey theorems
• Two extensions of Ramsey's theorem

This page was built for publication: Ramsey-Theory and Forcing Extensions

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