On polynomials and crossing numbers of complete graphs
Joseph M. Katz Graduate School of Business
University of Pittsburgh
: Mar, 1971
: Journal of Combinatorial TheoryVol.: 10- Issue: 2- Pages: 183-184
: 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.
: Complete graph, Graph theory