Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers
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.
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.