![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/f/f3/Zarankiewicz_K4_7.svg/640px-Zarankiewicz_K4_7.svg.png&w=640&q=50)
Turán's brick factory problem
On minimizing crossings in bicliques / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Zarankiewicz crossing number conjecture?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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.[1]
Unsolved problem in mathematics:
Can any complete bipartite graph be drawn with fewer crossings than the number given by Zarankiewicz?
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/f/f3/Zarankiewicz_K4_7.svg/320px-Zarankiewicz_K4_7.svg.png)
A drawing method found by Kazimierz Zarankiewicz has been conjectured to give the correct answer for every complete bipartite graph, and the statement that this is true has come to be known as the Zarankiewicz crossing number conjecture. The conjecture remains open, with only some special cases solved.[2]