科研之友
微信
新浪微博
Facebook
分享链接
摘要
It is shown that every complete -vertex simple topological graph has at pairwise disjoint edges, and these edges can be found in polynomial time. This proves a conjecture of Pach and Tth, which appears as Problem 5 from Chapter 9.5 in Research Problems in Discrete Geometry by Brass, Moser, and Pach.
- 出版日期2013-3
