This work is licensed under a
Creative Commons License.
|
Saturday, June 26, 2004
Note from Vereshchagin
Posted by Lance
I received the following from Nikolay Vereshchagin.The combinatorial question I have discussed last summer at the rump session at Computational complexity (about partitioning a planar set into a small number of uniform parts) has been answered almost immediately by Ilan Newman and Gabor Tárdos. They have found a pure combinatorial proof. Recently I have written a note on the subject.7:11 AM
# 0 comments
Links to this post:
Weblog Home
Archives
