New posts in Combinatorial Geometry

Unique question about packing problem

Minimizing the sum of the six distances determined by four points in the plane, if each distance is at least $d$

For $W=\cup_{U\in\mathcal U} U$ show that there exists $U_1,\dots,U_n: \ \sum_{i=1}^n \lambda(U_i) > \frac{1 - \epsilon}{3^d}\lambda(W)$

How many whole rectangles can you catch in a grid?

The Maximum number of points of intersection of 4 distinct circles and 8 distinct straight lines is

Number of $2$-colorings of edges of the $n$-dimensional cube?

British Mathematical Olympiad - December 2001 - Round 1 - Question 4

Partition of a rectangle into squares problem

How many vertices can a hypercube-hyperplane intersection have?

Why is the permutohedron simple?