Papers
Topics
Authors
Recent
Search
2000 character limit reached

Disjoint edges in complete topological graphs

Published 26 Oct 2011 in math.CO and cs.CG | (1110.5684v2)

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.

Citations (21)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Andrew Suk 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up