The following pages link to (Q3310509):
Displaying 14 items.
- Dissecting the square into five congruent parts (Q501065) (← links)
- Dissecting a square into rectangles of equal area (Q595670) (← links)
- Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space (Q762489) (← links)
- On filling space with different integer cubes (Q788733) (← links)
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry (Q789732) (← links)
- The number of different distances determined by n points in the plane (Q791525) (← links)
- Extremal problems in discrete geometry (Q794651) (← links)
- Rectangular dissections of a square (Q1101117) (← links)
- On an application of Hall's representatives theorem to a finite geometry problem (Q1112047) (← links)
- Characterizing tileorders (Q1318356) (← links)
- Bounds on the measurable chromatic number of \({\mathbb{R}}\) (Q1824627) (← links)
- On separating two simple polygons by a single translation (Q1825657) (← links)
- Covering the convex quadrilaterals of point sets (Q2373933) (← links)
- On Steinhaus sets (Q2486129) (← links)
