This is a fuzzier follow-up to [this question.][1] Again, we construct the graph whose vertices are integers from $1$ to $n,$ and two vertices are connected whenever one of the corresponding integers divides the other, and then we lay the graph out radially, so the vertex corresponding to $1$ is at the center of the circle, and the others are clockwise around the circumference This is what we get (for $n=180). There are obviously patterns, but how do we explain them?

[![divisibility graph for $n=180$][2]][2]


  [1]: https://mathoverflow.net/questions/280985/divisibility-independence
  [2]: https://i.sstatic.net/3gN1q.png