Disjoint edges in complete topological graphs
Combinatorics
2012-08-16 v2 Computational Geometry
Abstract
It is shown that every complete n-vertex simple topological graph has at least Omega(n^{1/3}) pairwise disjoint edges, and these edges can be found in polynomial time. This proves a conjecture of Pach and T\'oth.
Keywords
Cite
@article{arxiv.1110.5684,
title = {Disjoint edges in complete topological graphs},
author = {Andrew Suk},
journal= {arXiv preprint arXiv:1110.5684},
year = {2012}
}