Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers

  • János Pach
  • Dömötör Pálvölgyi

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.

Published
2006-01-07
Article Number
N1