Erdős Problem #1171 — A Multicolor Partition Relation at
For every natural number , is
Equivalently, for every coloring of the pairs of a set of order type with colors, there is either a color- subset of order type , or a monochromatic triangle of size in one of the nonzero colors.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.