1 paper
Niantao Xie
Lebesgue's universal cover problem asks for the infimum of the areas of planar sets that contain a congruent copy of every planar set of diameter at most one. We work in the convex…