Turán's brick factory problem
Unsolved problem in mathematics: Can any complete bipartite graph be drawn with fewer crossings than the number given by Zarankiewicz? (more unsolved problems in mathematics) 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.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Turán's brick factory problem
Unsolved problem in mathematics: Can any complete bipartite graph be drawn with fewer crossings than the number given by Zarankiewicz? (more unsolved problems in mathematics) 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.
has abstract
Unsolved problem in mathematic ...... nly some special cases solved.
@en
Wikipage page ID
22,039,971
page length (characters) of wiki page
Wikipage revision ID
1,008,267,025
Link from a Wikipage to another Wikipage
mode
cs2
@en
title
Zarankiewicz's Conjecture
@en
urlname
ZarankiewiczsConjecture
@en
wikiPageUsesTemplate
subject
comment
Unsolved problem in mathematic ...... k factory during World War II.
@en
label
Turán's brick factory problem
@en