The Thickness of the Complete Graph
Lowell W. Beineke, Frank Harary · Canadian Journal of Mathematics · 1965
A graph G consists of a finite set of p points and q lines joining pairs of these points. Each line joins two distinct points and no pair of points is joined by more than one line. A subgraph of G is a graph whose points and lines are also in G. If every pair of points of a graph is joined by a line, the graph is called complete and is denoted by Kp. A planar graph can be embedded in the plane, that is, drawn in the plane in such a way that none of its lines intersect.