The three-color pseudo-disk arrangement conjecture
The three-color pseudo-disk arrangement conjecture
Let be a pseudo-disk arrangement, meaning a family of planar bodies whose boundaries are Jordan curves and such that the boundary of any member intersects the boundary of any other member in a connected curve. Let be a finite set of points. The pseudo-disk arrangement conjecture. Any finite set of points admits a -coloring such that every pseudo-disk in the arrangement containing at least points contains two points with different colors. The source presents this as a stronger conjecture than the convex-set homothetic-copy statement and gives no resolution.
Sources & referencesView supporting material
Primary source
Balázs Keszegh and Dömötör Pálvölgyi, “Proper Coloring of Geometric Hypergraphs”, arXiv:1612.02158 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.