minimizing the number of crossings in drawings of complete bipartite graphs is known as Turán's brick factory problem. For the minimum number of crossings is one.

is a graph with six vertices and nine edges, often referred to as the utility graph in reference to the problem. It has also been called the Thomsen graph after the 19th-century chemist Julius Thomsen.