CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Coloring geometric hyper-graph defined by an arrangement of half-planes
Authors
Radoslav Fulek
Publication date
26 November 2010
Publisher
View
on
arXiv
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
Similar works
Full text
Available Versions
Infoscience - École polytechnique fédérale de Lausanne
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:infoscience.tind.io:158705
Last time updated on 09/02/2018