Rainbow Ramsey theorems for colorings establishing negative partition relations

• Autorzy: András Hajnal
• Języki publikacji: EN

Abstrakty

EN

Given a function f, a subset of its domain is a rainbow subset for f if f is one-to-one on it. We start with an old Erdős problem: Assume f is a coloring of the pairs of ω₁ with three colors such that every subset A of ω₁ of size ω₁ contains a pair of each color. Does there exist a rainbow triangle? We investigate rainbow problems and results of this style for colorings of pairs establishing negative "square bracket" relations.

Kategorie tematyczne

• 03E05: Other combinatorial set theory

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Fundamenta Mathematicae
• Rocznik: 2008
• Tom: 198
• Numer: 3
• Strony: 255-262

Daty

wydano

2008

Twórcy

autor

András Hajnal

• Rényi Institute, Reáltanoda u. 13-15, 1053 Budapest, Hungary

Identyfikatory

DOI

10.4064/fm198-3-4