Is this graph with $n$ vertices a planar graph?

74 Views Asked by At

Let $n$ be a positive integer and let $G$ be a graph with vertices $2,...,n+1$ such that every vertex is connected to the vertex which is the number of its divisors. How can we prove that such a graph is planar? Also, does such a graph have a name?

1

There are 1 best solutions below

4
On

When n is large enough, we have vertices 2,4,8,16,32 whose spanning graph is a copy of clique of size 5, so G does not be planar.