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.
Board: Rado's boundedness conjecture
Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.
0 open issues, 0 that nobody works on, 0 worked on; 0 open pull requests.
main at 068d499: no checks on it yet.