Coloring geometric hyper-graph defined by an arrangement of half-planes

2010/02/24 by Fulek, Radoslav · 1 citation
#52C15 #52C30 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1002.4529

Abstract

We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.

Cited by

• Coloring Geometric Hypergraphs: A Survey

Related

• Coloring half-planes and bottomless rectangles
• Coloring Geometric Hypergraphs: A Survey
• Coloring Planar Homothets and Three-Dimensional Hypergraphs
• Coloring points with respect to squares
• Polychromatic Colorings of Unions of Geometric Hypergraphs