{
  "aliases": [
    "turans-brick-factory",
    "zarankiewicz-crossing-number-conjecture"
  ],
  "backlinks": null,
  "body": "\n## Statement\n\nIn 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.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "turans-brick-factory",
      "zarankiewicz-crossing-number-conjecture"
    ],
    "inventory": [
      "8HFM575YWV"
    ],
    "kind": "conjecture",
    "name": "Turán's brick factory problem",
    "same_as": {
      "wikidata": "Q25303632",
      "wikipedia": "Turán's brick factory problem"
    },
    "sources": [
      {
        "locator": "Turán's brick factory problem",
        "mention": "wikipedia://en/22039971",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:22039971@r1369230768"
      }
    ],
    "tag": "812BQ5TC19"
  },
  "kind": "conjecture",
  "link": "https://math2.tamnd.com/node/812BQ5TC19/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/812BQ5TC19.md",
  "msc": null,
  "name": "Turán's brick factory problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/812/812BQ5TC19.md",
  "status": null,
  "tag": "812BQ5TC19",
  "uri": "m2://812BQ5TC19",
  "url": "https://math2.tamnd.com/wiki/turans-brick-factory-problem/",
  "writing": {
    "tag": "812BQ5TC19",
    "kind": "conjecture",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "have": 0,
        "want": 1
      }
    ]
  }
}