Ramsey theory and forcing extensions
HTML articles powered by AMS MathViewer
- by Péter Komjáth PDF
- Proc. Amer. Math. Soc. 121 (1994), 217-219 Request permission
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
- A. Hajnal, True embedding partition relations, Finite and infinite combinatorics in sets and logic (Banff, AB, 1991) NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci., vol. 411, Kluwer Acad. Publ., Dordrecht, 1993, pp. 135–151. MR 1261201, DOI 10.1007/978-94-011-2080-7_{9}
- A. Hajnal and P. Komjáth, Embedding graphs into colored graphs, Trans. Amer. Math. Soc. 307 (1988), no. 1, 395–409. MR 936824, DOI 10.1090/S0002-9947-1988-0936824-0
- Saharon Shelah, Consistency of positive partition theorems for graphs and models, Set theory and its applications (Toronto, ON, 1987) Lecture Notes in Math., vol. 1401, Springer, Berlin, 1989, pp. 167–193. MR 1031773, DOI 10.1007/BFb0097339
Additional Information
- © Copyright 1994 American Mathematical Society
- 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