Indecomposable Coverings

DOI10.4153/CMB-2009-048-XMaRDI QIDQ5895103zbMATH OpenFDO

Authors János Pach, Gábor Tardos, Géza Tóth

Publication date 15 October 2009

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-2009-048-X

zbMATH Keywords

\(k\)-fold coverings of the planecoloring of points

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Indecomposable Coverings
• Indecomposable coverings with concave polygons
• Indecomposable coverings with homothetic polygons
• Multiple coverings with closed polygons
• Covering the plane with convex polygons

Cited in

(17)

• Borsuk's covering for blunt bodies
• Coloring points with respect to squares
• Coloring Delaunay-edges and their generalizations
• Proper coloring of geometric hypergraphs
• Indecomposable coverings with homothetic polygons
• Octants are cover-decomposable into many coverings
• A note on the pyjama problem
• Octants are cover-decomposable
• On the number of points in general position in the plane
• Tight lower bounds for the size of epsilon-nets
• Coloring Axis-Parallel Rectangles
• Indecomposable Coverings
• A non-linear lower bound for planar epsilon-nets
• Erdős-Szekeres maker-breaker games
• Erdős-Szekeres maker-breaker games
• On colorings of hypergraphs embeddable in \(\mathbb{R}^d\)
• Coloring axis-parallel rectangles

This page was built for publication: Indecomposable Coverings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895103)