arXiv · 2611.21416
Polynomial bounds for quasiplanar graphs
Abstract
A graph $G$ is $k$-quasiplanar if it can be drawn in the plane without $k$ pairwise crossing edges. It was a longstanding conjecture that $n$-vertex $k$-quasiplanar graphs have $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 $k$-quasiplanar graphs have at most $k^{O(k)}n$ edges. In this note, we greatly improve the dependence on $k$ and show that every $k$-quasiplanar $n$-vertex graph has at most $O(k^2n)$ edges. The proof is based on a geometric charging scheme and Erdős-Szekeres type combinatorial arguments.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Aleksa Milojević, Patryk Morawski, Benny Sudakov, Istvan Tomon. 2026-11-16. Polynomial bounds for quasiplanar graphs. https://searcharxiv.com/abs/2611.21416
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.