---
tag: 812BQ5TC19
kind: conjecture
name: Turán's brick factory problem
aliases: [turans-brick-factory, zarankiewicz-crossing-number-conjecture]
sources:
  - wikipedia: en:22039971@r1369230768
    locator: Turán's brick factory problem
    note: adopted
    mention: wikipedia://en/22039971
    sections: [Statement]
same_as:
  wikidata: Q25303632
  wikipedia: Turán's brick factory problem
inventory: [8HFM575YWV]
---

## Statement

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|0V0GC7BQAN]]. 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.