Abstract
A topological graph drawn on a cylinder whose base is horizontal is \emph{angularly monotone} if every vertical line intersects every edge at most once. Let denote the maximum number such that every simple angularly monotone drawing of a complete graph on vertices contains at least pairwise disjoint edges. We show that for every simple complete topological graph there exists , , such that contains at least pairwise disjoint edges. By combining our result with a result of Tóth we obtain an alternative proof for the best known lower bound of on the maximum number of pairwise disjoint edges in a simple complete topological graph proved by Suk. Our proof is based on a result of Ruiz-Vargas.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.