Partitioning the edges of $K_n$ into $\lfloor \frac n6 \rfloor$ planar subgraphs

269 Views Asked by At

Why is it impossible to partition the edges in $K_n$ into $\lfloor \frac n6 \rfloor$ planar subgraphs for $n \ge 6$?
I'm just stuck at the beginning and can't figure out how to go about this problem.

Thanks in advance for the help!

1

There are 1 best solutions below

0
On BEST ANSWER

Hint: Show that at least one of the $\lfloor \frac{n}{6}\rfloor$ subgraphs must contain more than $3n - 6$ edges.