Sebő András (CNRS, Grenoble, France), Packing and Covering Squares : Answers and Questions

Given a family of squares in the plane,  the packing problem asks for the maximum number of pairwise disjoint squares among them, while the hitting problem  for the minimum number   of points hitting all of them. These problems have been  investigated for several classes of convex sets, important efforts have been invested for getting the best possible bound for disks, but  they are apparently completely forgotten for the simplest objects:  squares. I present open and closed related problems  for  squares, unit or of different sizes, axis-parallel or "dancing", etc.
This is joint work with Marco Caoduro

The zoom ID

296 194 6869

or

https://zoom.us/j/2961946869?omn=98603280031