Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers

  • János Pach
  • Dömötör Pálvölgyi
DOI: https://doi.org/10.37236/1139

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
How to Cite
Pach, J., & Pálvölgyi, D. (2006). Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers. The Electronic Journal of Combinatorics, 13(1), N1. https://doi.org/10.37236/1139
Issue
Volume 13 (2006)
Article Number
N1