Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Covering problem of Rado
open-in-new
Unsolved problem in mathematics What is the arrangements of squares with parallel edges which has the smallest area-maximizing subset of squares in which the squares in the subset do not overlap? <a href="/facts/List_of_unsolved_problems_in_mathematics/RroxGPpP">More unsolved problems in mathematics</a> <p>The covering problem of Rado is an unsolved problem in <a href="/facts/Geometry/wTQf5ffQ">geometry</a> concerning covering planar sets by squares. It was formulated in 1928 by <a href="/facts/Tibor_Rad%25C3%25B3/wputMr4V">Tibor Radó</a> and has been generalized to more general shapes and higher dimensions by <a href="/facts/Richard_Rado/QXBFIwBd">Richard Rado</a>. </p>