Name
Abstract | ||
|---|---|---|
We study whether for a given planar family F there is an m such that any finite set of points can be 3-colored such that any member of F that contains at least m points contains two points with different colors. We conjecture that if F is a family of pseudo-disks, then m=3 is sufficient. We prove that when F is the family of all homothetic copies of a given convex polygon, then such an m exists. We also study the problem in higher dimensions. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.4230/LIPIcs.SoCG.2017.47 | Symposium on Computational Geometry |
DocType | Volume | Citations |
Conference | abs/1612.02158 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balázs Keszegh | 1 | 156 | 24.36 |
| Dömötör Pálvölgyi | 2 | 202 | 29.14 |