Erdős problem 188 · problems.science

What is the smallest $k$ such that $\mathbb{R}^2$ can be red/blue coloured with no pair of red points unit distance apart, and no $k$ -term arithmetic progression of blue points with distance 1?

Sources

Browse retained paths and inspect the exact material available for this Problem.

3 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

188.lean

Retained formal statement3 of 3

Old and new problems and results in combinatorial number theory by Erdős & Graham (Page 14, 15):

It has been shown that there is a large $M$ so that it is possible to partition $\mathbb{E}^2$ into two sets $A$ and $B$ so that $A$ contains no pair of points with distance 1 and $B$ contains no A.P. of length $M$ .

FormalConjectures/ErdosProblems/188.leanErdos188.erdos_188.variants.nonempty1 lineExact file

1Erdos188.s.Nonempty

SolvedStatement only, no proof

Sources

Search problems.science