On polynomials and crossing numbers of complete graphs

Thomas Saaty
Joseph M. Katz Graduate School of Business
University of Pittsburgh
United States

Publication date: Mar, 1971

Journal: Journal of Combinatorial Theory
Vol.: 10- Issue: 2- Pages: 183-184

Abstract: A long-standing, unsolved problem is that of finding the minimum number of crossings of the edges in a complete graph when embedded on a surface of genus zero.

Keywords: Complete graph, Graph theory