Proper coloring of geometric hypergraphs
From MaRDI portal
Publication:4580123
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 such an m exists. We prove this in the special case when F is the family of all homothetic copies of a given convex polygon. We also study the problem in higher dimensions.
Recommendations
Cited in
(13)- Colorful strips
- Proper coloring of geometric hypergraphs
- Polychromatic colorings of unions of geometric hypergraphs
- Coloring intersection hypergraphs of pseudo-disks
- On proper colourings of hypergraphs using prescribed colours
- Coloring Geometric Range Spaces
- Coloring points with respect to squares
- Coloring hypergraphs defined by stabbed pseudo-disks and \(ABAB\)-free hypergraphs
- Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
- Colorful strips
- Coloring intersection hypergraphs of pseudo-disks
- Coloring planar homothets and three-dimensional hypergraphs
- Coloring geometric range spaces
This page was built for publication: Proper coloring of geometric hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580123)