全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
Mathematics  2010 

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

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133