Displaying similar documents to “Discrepancy of symmetric products of hypergraphs.”

Rainbow Ramsey theory.

Jungić, Veselin, Nešetřil, Jaroslav, Radoičić, Radoš (2005)



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.

Three edge-coloring conjectures

Richard H. Schelp (2002)

Discussiones Mathematicae Graph Theory


The focus of this article is on three of the author's open conjectures. The article itself surveys results relating to the conjectures and shows where the conjectures are known to hold.