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
Proper coloring of geometric hypergraphs
Authors
Balázs Keszegh
Dömötör Pálvölgyi
Publication date
1 January 2017
Publisher
Schloss Dagstuhl Leibniz-Zentrum für Informatik
Doi
Cite
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. © Balázs Keszegh and Dömötör Pálvölgyi
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Repository of the Academy's Library
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:real.mtak.hu:71208
Last time updated on 09/01/2018