Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

Ramsey theory and forcing extensions


Author: Péter Komjáth
Journal: Proc. Amer. Math. Soc. 121 (1994), 217-219
MSC: Primary 03E05; Secondary 03E35, 05C55
DOI: https://doi.org/10.1090/S0002-9939-1994-1169039-2
MathSciNet review: 1169039
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In every forcing extension of every model of set theory by a nontrivial (set) forcing there exist a graph Y and a cardinal $ \mu $, such that every graph has an edge coloring with $ \mu $. colors with no monochromatic induced copy of Y.


References [Enhancements On Off] (What's this?)

  • [1] A. Hajnal, True embedding partition relations, Proc. of the Banff Conference (to appear). MR 1261201 (95d:03085)
  • [2] A. Hajnal and P. Komjáth, Embedding graphs into colored graphs, Trans. Amer. Math. Soc. 307 (1988), 395-409. Corrigendum. MR 936824 (89e:05145)
  • [3] S. Shelah, Consistency of positive partition theorems for graphs and models, Set Theory and Applications (J. Steprans and S. Watson, eds.), Lecture Notes in Math., vol. 1401, Springer-Verlag, New York, 1989, pp. 167-193. MR 1031773 (91a:03102)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 03E05, 03E35, 05C55

Retrieve articles in all journals with MSC: 03E05, 03E35, 05C55


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1994-1169039-2
Article copyright: © Copyright 1994 American Mathematical Society

American Mathematical Society