Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Embeddability of arrangements of pseudocircles and graphs on surfaces (1704.07688v2)

Published 25 Apr 2017 in math.CO, cs.CG, and math.GT

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

We haven't generated a summary for this paper yet.