























Abstract:A graph on $n \ge 3$ vertices drawn in the plane such that each edge is crossed at most four times has at most $6(n-2)$ edges -- this result, proven by Ackerman, is outstanding in the literature of beyond-planar graphs with regard to its tightness and the structural complexity of the graph class. We provide a much shorter proof while at the same time relaxing the conditions on the graph and its embedding, i.e., allowing multi-edges and non-simple drawings.
From: Aaron Büngener [view email]
[v1]
Thu, 25 Sep 2025 10:49:55 UTC (176 KB)
[v2]
Thu, 2 Oct 2025 15:40:08 UTC (185 KB)
[v3]
Thu, 11 Jun 2026 19:08:10 UTC (185 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。