Turán's brick factory problem
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. 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.
Further reading
- Wikipedia, page 22039971, revision 1369230768, Turán's brick factory problem. adopted
About this page
| Tag | 812BQ5TC19 |
|---|---|
| URI | m2://812BQ5TC19 |
| Aliases | turans-brick-factory, zarankiewicz-crossing-number-conjecture |
| Kind | conjecture |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status 812BQ5TC19. |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.