CSUN Algebra, Number Theory, and Discrete Mathematics Seminar

In a $k$-page book drawing of a graph $G$, the vertices of $G$ are placed on a line $l$ and each edge is completely contained in one of $k$ fixed halfplanes whose boundary is $l$. The line $l$ is called the spine and the halfplanes are called pages. The $k$-page book crossing number of the graph $G$ is the minimum number of edge-crossings over all $k$-page book drawings of $G$. Book crossing numbers have been studied in relation to their applications in VLSI designs. In this talk, we present an overview and latest results on the $k$-page book crossing number of the complete graph on $n$ vertices.