A covering theorem for families of sets in R^d

DOI10.4310/JOC.2010.V1.N1.A5zbMATH Open1206.52014MaRDI QIDQ989230FDOQ989230

Authors: John E. Wetzel, Wacharin Wichiramala 

Publication date: 30 August 2010

Published in: Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• A small cover for convex unit arcs
• A smaller cover for convex unit arcs
• The worm problem of Leo Moser
• On a covering problem in the plane
• Covers for Angleworms

zbMATH Keywords

coverworm problem

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cited In (6)

• Wetzel's sector covers unit arcs
• \(z\)-arcs in the thirty degrees sector
• Covering \(n\)-segment unit arcs is not sufficient
• Covering the Baire space by families which are not finitely dominating
• Title not available (Why is that?)
• Sectorial covers for unit arcs

This page was built for publication: A covering theorem for families of sets in \(\mathbb R^d\)

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