Turán's brick factory problem
finding the minimum number of crossings in a drawing of a complete bipartite graph
Press Enter · cited answer in seconds
0 sources
Turán's brick factory problem
Summary
Turán's brick factory problem is a mathematical problem[1]. It draws 16 Wikipedia views per month (mathematical_problem category, ranking #71 of 128).[2]
Key Facts
- Turán's brick factory problem's instance of is recorded as mathematical problem[3].
- Pál Turán is named after Turán's brick factory problem[4].
- Turán's brick factory problem's facet of is recorded as graph drawing[5].
- Turán's brick factory problem's Google Knowledge Graph ID is recorded as /g/11bzt4zs3y[6].
- Turán's brick factory problem's MathWorld ID is recorded as ZarankiewiczsConjecture[7].
- Turán's brick factory problem's maintained by WikiProject is recorded as WikiProject Mathematics[8].
Why It Matters
Turán's brick factory problem draws 16 Wikipedia views per month (mathematical_problem category, ranking #71 of 128).[2]