加入
Rado's boundedness conjecture
Show that a linear equation that some finite colouring of the integers avoids can be avoided with a number of colours depending only on its length.
+19 −0 scienceslack.json 新增 查看文件
| @@ -0,0 +1,19 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "mathematics", | |
| 3 | + "topics": [ | |
| 4 | + "combinatorics", | |
| 5 | + "number-theory" | |
| 6 | + ], | |
| 7 | + "type": "proof", | |
| 8 | + "source": { | |
| 9 | + "key": "green-100", | |
| 10 | + "name": "Ben Green's 100 open problems", | |
| 11 | + "url": "https://people.maths.ox.ac.uk/greenbj/papers/open-problems.pdf#problem.21", | |
| 12 | + "id": "21", | |
| 13 | + "curator": "Ben Green", | |
| 14 | + "poser": "Richard Rado", | |
| 15 | + "status": "open", | |
| 16 | + "as_of": "2026-10-20", | |
| 17 | + "catalog": "0521c19bbd38" | |
| 18 | + } | |
| 19 | +} | |