Disjoint edges in complete topological graphs

Details Disjoint edges in complete topological graphs Disjoint edges in complete topological graphs

2011-10-26

arxiv.org/abs/1110.5684v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Disjoint edges in complete topological graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Disjoint edges in complete topological graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Disjoint edges in complete topological graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-716826