On point covers of parallel rectangles

DOI10.1007/BF02280661zbMath0759.05027MaRDI QIDQ1182539

S. Singh

Publication date: 28 June 1992

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

parallel rectanglespoint covers

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

Related Items (23)

Local boxicity ⋮ Disjointness graphs of segments in the space ⋮ A simple proof of the Zeilberger–Bressoud 𝑞-Dyson theorem ⋮ Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve ⋮ On point covers of multiple intervals and axis-parallel rectangles ⋮ From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem ⋮ Ramsey properties of semilinear graphs ⋮ Lower bounds for piercing and coloring boxes ⋮ Coloring lines and Delaunay graphs with respect to boxes ⋮ Piercing translates and homothets of a convex body ⋮ Coloring the complements of intersection graphs of geometric figures ⋮ Intersection of parallelepipeds in \(\mathbb R^d\) ⋮ Piercing axis-parallel boxes ⋮ Covering boxes by points ⋮ On Wegner's inequality for axis-parallel rectangles ⋮ On point covers of \(c-\)oriented polygons ⋮ Piercing all translates of a set of axis-parallel rectangles ⋮ From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem ⋮ Transversal numbers of translates of a convex body ⋮ Fast stabbing of boxes in high dimensions ⋮ Piercing numbers in approval voting ⋮ Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity ⋮ Piercing all translates of a set of axis-parallel rectangles

Cites Work

• Covering and coloring problems for relatives of intervals
• Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets
• Unnamed Item

This page was built for publication: On point covers of parallel rectangles