Use Exercise 32 to show that the thickness of Kn is at

Chapter , Problem 33E

(choose chapter or problem)

The thickness of a simple graph $G$ is the smallest number of planar subgraphs of $G$ that have $G$ as their union.

Use Exercise 32 to show that the thickness of $K_{n}$ is at least $\lfloor(n+7) / 6\rfloor$ whenever $n$ is a positive integer.

Equation Transcription:

$G$

${K}_{n}$

⌊ $(n+7)/6$ ⌋

$n$

Text Transcription:

K_n

⌊(n+7)/6⌋

Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.

Login