Keywords

#turán's_brick_factory_problem

Turán's brick factory problem

On minimizing crossings in bicliques

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.

Thu 11th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Turán's brick factory problem Three utilities problem Pál Turán Crossing number (graph theory) List of unsolved problems in mathematics Complete bipartite graph Kazimierz Zarankiewicz List of incomplete or incorrect mathematical proofs Topological graph Glossary of graph theory
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.