The coloring conjecture for the rhombus
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.
References
Primary source
Alexey Glazyrin and Igor Pak, “Domes over curves”, arXiv:2005.02555 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.