Turán's brick factory problem
On minimizing crossings in bicliques
In the mathematics of graph drawing, Turán's brick factory problem asks for the minimum number of crossings in a drawing of a complete bipartite graph.
ATK 3737DEF 6240
On minimizing crossings in bicliques
In the mathematics of graph drawing, Turán's brick factory problem asks for the minimum number of crossings in a drawing of a complete bipartite graph.
On minimizing crossings in bicliques
★ First discovered by @agatlm · 2026-11-01
In the mathematics of graph drawing, Turán's brick factory problem asks for the minimum number of crossings in a drawing of a complete bipartite graph. The problem is named after Pál Turán, who formulated it while being forced to work in a brick factory during World War II.
No sale yet.
None on the Market right now.