Papers
Topics
Authors
Recent
Search
2000 character limit reached

Embeddability of arrangements of pseudocircles and graphs on surfaces

Published 25 Apr 2017 in math.CO, cs.CG, and math.GT | (1704.07688v2)

Abstract: A pseudocircle is a simple closed curve on some surface; an arrangement of pseudocircles is a collection of pseudocircles that pairwise intersect in exactly two points, at which they cross. Ortner proved that an arrangement of pseudocircles is embeddable into the sphere if and only if all of its subarrangements of size at most four are embeddable into the sphere, and asked if an analogous result holds for embeddability into orientable surfaces of higher genus. We answer this question positively: An arrangement of pseudocircles is embeddable into an orientable surface of genus~$g$ if and only if all of its subarrangements of size at most $4g+4$ are. Moreover, this bound is tight. We actually have similar results for a much general notion of arrangement, which we call an \emph{arrangement of graphs}.

Summary

Paper to Video (Beta)

Whiteboard

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

Open Problems

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

Continue Learning

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

Collections

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