跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21416 · v1

Polynomial bounds for quasiplanar graphs

首次提交 2026-11-17 01:05
版本更新 2026-11-17 01:05
雷达观测 2026-11-17 16:10
arXiv ↗PDF ↗

摘要

A graph GG is kk-quasiplanar if it can be drawn in the plane without kk pairwise crossing edges. It was a longstanding conjecture that nn-vertex kk-quasiplanar graphs have Ok(n)O_k(n) edges. This was recently resolved by Sadhu and, independently, by Pach, Tardos, and Zeng, based on a theorem in topology proven by Beeker and Lazarovich. These papers showed that kk-quasiplanar graphs have at most kO(k)nk^{O(k)}n edges. In this note, we greatly improve the dependence on kk and show that every kk-quasiplanar nn-vertex graph has at most O(k2n)O(k^2n) edges. The proof is based on a geometric charging scheme and Erdős-Szekeres type combinatorial arguments.

作者备注:11 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 01:05 · 最新观测版本

Polynomial bounds for quasiplanar graphs

A graph GG is kk-quasiplanar if it can be drawn in the plane without kk pairwise crossing edges. It was a longstanding conjecture that nn-vertex kk-quasiplanar graphs have Ok(n)O_k(n) edges. This was recently resolved by Sadhu and, independently, by Pach, Tardos, and Zeng, based on a theorem in topology proven by Beeker and Lazarovich. These papers showed that kk-quasiplanar graphs have at most kO(k)nk^{O(k)}n edges. In this note, we greatly improve the dependence on kk and show that every kk-quasiplanar nn-vertex graph has at most O(k2n)O(k^2n) edges. The proof is based on a geometric charging scheme and Erdős-Szekeres type combinatorial arguments.

查看此版本解读 →查看此版本原文 ↗