Ontify
⌘
S
⌘
S
Share
Turán's Brick Factory Problem
Finding the minimum number of crossings in a drawing of a complete bipartite graph.
Wikipedia | Turán's Brick Factory Problem
External Pages About Turán's Brick Factory Problem
Google Knowledge Graph
Statements about
Turán's Brick Factory Problem
Named After
Pál Turán
Instance Of
Mathematical Problem
Facet Of
Graph Drawing
