scientific article
From MaRDI portal
Publication:3310509
zbMath0528.52001MaRDI QIDQ3310509
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Problem books (00A07) Other problems of combinatorial convexity (52A37) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Convex and discrete geometry (52-XX)
Related Items (14)
Covering the convex quadrilaterals of point sets ⋮ Rectangular dissections of a square ⋮ On an application of Hall's representatives theorem to a finite geometry problem ⋮ Dissecting a square into rectangles of equal area ⋮ Dissecting the square into five congruent parts ⋮ On Steinhaus sets ⋮ Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space ⋮ Bounds on the measurable chromatic number of \({\mathbb{R}}\) ⋮ On separating two simple polygons by a single translation ⋮ On filling space with different integer cubes ⋮ On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry ⋮ The number of different distances determined by n points in the plane ⋮ Extremal problems in discrete geometry ⋮ Characterizing tileorders
This page was built for publication:
