Prove CompleteCrossing (openai/math family 165: Exact crossing numbers of complete and complete bipartite…
Prove CompleteCrossing (openai/math family 165: Exact crossing numbers of complete and complete bipartite…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 165 of the release, Exact crossing numbers of complete and complete bipartite graphs…
The task
Context: this statement belongs to family 165 of the release, *Exact crossing numbers of complete and complete bipartite graphs* (Combinatorics). The family as a whole: Resolves the Harary–Hill conjecture and Turan's brickyard problem in the Zarankiewicz formulation, determining the crossing numbers of every complete…
Part of raising-heart/openai-math.