Home ยป Separators in string graphs

Jiri Matousek has almost

On January 21st, 2014 David Wood says:

Jiri Matousek has almost solved this problem. He proves a $ O(\sqrt m \log m) $ upper bound in "Near-optimal separators in string graphs" at arXiv:1302.6482.

Reply

Comments are limited to a maximum of 1000 characters.
More information about formatting options