The coloring conjecture for the rhombus
The coloring conjecture for the rhombus
From papers
Let be the unit distance graph of , and let be the unit rhombus defined in the source. A coloring is a map . Coloring conjecture for . There is a coloring with no rainbow unit triangles and with , , and . Such a coloring would imply that cannot be domed by the stated proposition.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Alexey Glazyrin and Igor Pak, “Domes over curves”, arXiv:2005.02555 (2021).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.