📖
Logarithmic edge-length ratios for planar drawings of 2-trees
Zahra Sabaei, Fatemeh Emami, Yasmin Tousinejad

Logarithmic edge-length ratios for planar drawings of 2-trees

Science & Mathematics Published 2026 Verification Pending

Overview & Synopsis

For a planar graph $G$ with at least one edge, let $ρ(G)$ be the infimum of the ratio of the longest to the shortest edge length over all planar straight-line drawings of $G$. We prove that every $n$-vertex $2$-tree $G$ satisfies $ρ(G)\le4+5\lfloor\log_2(2n-3)\rfloor$. This improves the known $O(\sqrt n)$ upper bound and, together with the lower bound of Blažej, Fiala and Liotta, shows that the maximum of $ρ(G)$ over $n$-vertex $2$-trees is $Θ(\log n)$. The proof adapts Biedl's recursive bar construction using nonintegral heights and applies a height-preserving straightening theorem.

Indexed from repository: arXiv (arxiv.org)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Logarithmic edge-length ratios for planar drawings of 2-trees
Author / Organization Zahra Sabaei, Fatemeh Emami, Yasmin Tousinejad
Subject & Discipline math.CO
Categories Science & Mathematics
Publication Year 2026
License / Rights arXiv Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website arXiv (arxiv.org)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-270568
Original Source Link Visit Source Page on arxiv.org »