12 problems
The product conjecture. For every positive integer , there exists a positive integer such that some scaling of is -Ramsey for .
One-point extension conjecture. The set is Ramsey.
Block sets conjecture. For every pair of positive integers and and every template over , there exist positive integers and such that every -colouring of…
A finite set is Ramsey if, for every , there exists an integer such that every -colouring of contains a monochromatic isometric copy…
A finite set in a Euclidean space is Ramsey if, for every , some dimension contains a monochromatic congruent copy of under every -colouring. Graham's bo…
Let be a set, and call it non-spherical if it is not contained in the surface of a sphere of any dimension. Write for the relevant -point line co…
Let be a set. Call Ramsey if for every natural number there exists such that every -colouring of contains a monochromatic copy…
For integers , let denote -dimensional Euclidean space, and let denote a set of equally spaced collinear points. Write…
Cyclic-quadrilateral conjecture. There exists a cyclic quadrilateral that is not subtransitive.
Template conjecture. For every pair of positive integers and , and every template over , there exist positive integers and such that every -colouring…
Block-permutation conjecture. For every pair of positive integers and , there exist positive integers and such that every -colouring of contains a block p…
Product conjecture. For every positive integer , there exists a positive integer such that some scaling of is -Ramsey for .