Turán's brick factory problem (Q25303632)
Jump to navigation
Jump to search
finding the minimum number of crossings in a drawing of a complete bipartite graph
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Turán's brick factory problem |
finding the minimum number of crossings in a drawing of a complete bipartite graph |
Statements
Identifiers
Sitelinks
Wikipedia(3 entries)
- enwiki Turán's brick factory problem
- ruwiki Проблема Заранкевича
- ukwiki Задача Турана про цегельний завод