Coloring planar homothets and three-dimensional hypergraphs

Jean Cardinal, Matias Korman

研究成果: Article査読

7 被引用数 (Scopus)

抄録

We prove that every finite set of homothetic copies of a given convex body in the plane can be colored with four colors so that any point covered by at least two copies is covered by two copies with distinct colors. This generalizes a previous result from Smorodinsky (SIAM J. Disc. Math. 2007). Then we show that for any k≥2, every three-dimensional hypergraph can be colored with 6(k-1) colors so that every hyperedge e contains min{|e|,k} vertices with mutually distinct colors. This refines a previous result from Aloupis et al. (Disc. & Comp. Geom. 2009). As corollaries, we improve on previous results for conflict-free coloring, k-strong conflict-free coloring, and choosability. Proofs of the upper bounds are constructive and yield simple, polynomial-time algorithms.

本文言語English
ページ(範囲)1027-1035
ページ数9
ジャーナルComputational Geometry: Theory and Applications
46
9
DOI
出版ステータスPublished - 2013 7 19
外部発表はい

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

フィンガープリント 「Coloring planar homothets and three-dimensional hypergraphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル