22 problems
- 0 votes0 replies0 views
Leader–Russell–Walters' transitive-extension conjecture for Ramsey sets
Leader–Russell–Walters' conjecture. A finite set is Ramsey if and only if it is a subset of some finite transitive set .
- 0 votes0 replies0 views
Graham's conjecture on spherical Euclidean Ramsey sets
A finite set is spherical if it lies on the surface of some -dimensional sphere. A finite set is Ramsey if, for every , there exists an integer …
- 0 votes0 replies0 views
The Erdős–Graham–Montgomery–Rothschild–Spencer–Straus conjecture on planar Ramsey triangles
Let a finite set be -Ramsey if every -coloring of contains a monochromatic congruent copy of . A triangle is non-equilateral if its…
- 0 votes0 replies0 views
Weak Knaster conjecture
Let and be positive integers. For an integer , let be any set of points on the unit sphere , and let…
- 0 votes0 replies1 view
The one-point extension conjecture for Euclidean Ramsey sets
One-point extension conjecture. The set is Ramsey.
- 0 votes0 replies0 views
The block sets conjecture
Block sets conjecture. For every pair of positive integers and and every template over , there exist positive integers and such that every -colouring of…
- 0 votes0 replies0 views
The Erdős–Graham–Montgomery–Rothschild–Spencer–Straus spherical Ramsey-set conjecture
Spherical Ramsey-set conjecture. A finite set is Ramsey if and only if it is spherical.
- 0 votes0 replies0 views
Conlon–Wu conjecture on avoiding arithmetic progressions with a non-spherical set
Conlon–Wu conjecture. For every non-spherical set , there exists a natural number such that
- 0 votes0 replies0 views
Erdős et al.'s Euclidean Ramsey conjecture for non-equilateral three-point configurations
Erdős et al.'s conjecture. For every non-equilateral three-point configuration , every 2-coloring of contains a monochromatic congruent copy of in one of the…
- 0 votes0 replies0 views
The non-equilateral triangle Euclidean Ramsey conjecture
Let be a triangle in the Euclidean plane, and write for the assertion that every -coloring of contains a monochromatic copy of…
- 0 votes0 replies1 view
Graham's three-color conjecture for monochromatic triangles in the Euclidean plane
Let be a triangle, and let be the minimum number of colors needed to color the Euclidean plane so that no isometric copy of is monochromatic. Graham'…
- 0 votes0 replies1 view
Erdős et al.'s lower-bound conjecture for monochromatic triangles in the Euclidean plane
Let be a triangle, and let be the minimum number of colors needed to color the Euclidean plane so that no isometric copy of is monochromatic. Erdős e…
- 0 votes0 replies0 views
Erdős's conjecture on infinite sets universal in measure
Erdős's conjecture. No infinite set is universal in measure.
- 0 votes0 replies1 view
The non-spherical obstruction conjecture for Euclidean Ramsey sets
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…
- 0 votes0 replies1 view
The Ramsey characterisation by monochromatic line configurations
Let be a set. Call Ramsey if for every natural number there exists such that every -colouring of contains a monochromatic copy…
- 0 votes0 replies0 views
The minimal red progression length in Euclidean Ramsey theory
For integers , let denote -dimensional Euclidean space, and let denote a set of equally spaced collinear points. Write…
- 0 votes0 replies0 views
The non-subtransitive cyclic-quadrilateral conjecture
Cyclic-quadrilateral conjecture. There exists a cyclic quadrilateral that is not subtransitive.
- 0 votes0 replies0 views
The uniform-template conjecture for monochromatic block sets
Uniform-template conjecture. For every pair of positive integers and , and every template over , there exist positive integers and such that every -co…
- 0 votes0 replies0 views
The template conjecture for monochromatic block sets
Template conjecture. For every pair of positive integers and , and every template over , there exist positive integers and such that every -colouring…
- 0 votes0 replies1 view
The block-permutation conjecture
Block-permutation conjecture. For every pair of positive integers and , there exist positive integers and such that every -colouring of contains a block p…
- 0 votes0 replies0 views
The product conjecture for finite transitive sets
Product conjecture. For every positive integer , there exists a positive integer such that some scaling of is -Ramsey for .
- 0 votes0 replies0 views
The transitive-set characterization of Euclidean Ramsey sets
The transitive-set conjecture. A finite set is Ramsey if and only if it is congruent to a subset of a finite transitive set.