Author:
Pach János,Pálvölgyi Dömötör
Abstract
We construct graphs with $n$ vertices of maximum degree $5$ whose every straight-line drawing in the plane uses edges of at least $n^{1/6-o(1)}$ distinct slopes.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献