Rainbow Ramsey theorems for colorings establishing negative partition relations

András Hajnal. "Rainbow Ramsey theorems for colorings establishing negative partition relations." Fundamenta Mathematicae 198.3 (2008): 255-262. <http://eudml.org/doc/283275>.

@article{AndrásHajnal2008,
abstract = {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.},
author = {András Hajnal},
journal = {Fundamenta Mathematicae},
keywords = {partition relation; rainbow subset; coloring},
language = {eng},
number = {3},
pages = {255-262},
title = {Rainbow Ramsey theorems for colorings establishing negative partition relations},
url = {http://eudml.org/doc/283275},
volume = {198},
year = {2008},
}

TY - JOUR
AU - András Hajnal
TI - Rainbow Ramsey theorems for colorings establishing negative partition relations
JO - Fundamenta Mathematicae
PY - 2008
VL - 198
IS - 3
SP - 255
EP - 262
AB - 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.
LA - eng
KW - partition relation; rainbow subset; coloring
UR - http://eudml.org/doc/283275
ER -