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

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

2010-02-24

arxiv.org/abs/1002.4529v2

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Coloring geometric hyper-graph defined by an arrangement of half-planes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Coloring geometric hyper-graph defined by an arrangement of half-planes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coloring geometric hyper-graph defined by an arrangement of half-planes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260686