Talk:Lebesgue's universal covering problem
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
solved?
[edit]--Kmhkmh (talk) 20:02, 15 November 2018 (UTC)
- Not yet. Gibbs found a new smallest known cover. The article should be updated if his result is checked to be correct. --Chstdu (talk) 11:31, 16 November 2018 (UTC)