Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Rainbow Ramsey theorems for colorings establishing negative partition relations

András Hajnal — 2008

Fundamenta Mathematicae

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.

Page 1

Download Results (CSV)