A strongly non-Ramsey uncountable graph

• Autorzy: Péter Komjáth
• Języki publikacji: EN

Abstrakty

EN

It is consistent that there exists a graph X of cardinality $ℵ_1$ such that every graph has an edge coloring with $ℵ_1$ colors in which the induced copies of X (if there are any) are totally multicolored (get all possible colors).

Kategorie tematyczne

• 05D10: Ramsey theory
• 05C55: Generalized Ramsey theory
• 03E35: Consistency and independence results

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Fundamenta Mathematicae
• Rocznik: 1997
• Tom: 154
• Numer: 2
• Strony: 203-205

Daty

wydano

1997

otrzymano

1996-08-14

poprawiono

1996-11-03

Twórcy

autor

Péter Komjáth

• Department of Computer Science, Eötvös University, Múzeum krt. 6-8, 1088 Budapest, Hungary

Bibliografia

• [1] P. Erdős, A. Hajnal, A. Máté and R. Rado, Combinatorial Set Theory: Partition Relation for Cardinals, North-Holland, 1984.
• [2] A. Hajnal and P. Komjáth, Embedding graphs into colored graphs, Trans. Amer. Math. Soc. 307 (1988), 395-409; corrigendum: 332 (1992), 475.
• [3] S. Shelah, Consistency of positive partition theorems for graphs and models, in: Set Theory and Applications, J. Steprāns and S. Watson (eds.), Lecture Notes in Math. 1401, Springer, 1989, 167-193.
• [4] S. Todorčević, Coloring pairs of countable ordinals, Acta Math. 159 (1987), 261-294.