Turán's brick factory problem
finding the minimum number of crossings in a drawing of a complete bipartite graph
| rdfs:label |
"Turán's brick factory problem"@en
|
|
skos:alt |
"conjectura de Zarankiewicz"@ca
|
| schema:description |
"finding the minimum number of crossings in a drawing of a complete bipartite graph"@en
|
|
schema:date |
"2026-09-26T12:59:15+00:00"^^xsd:dateTime |
| schema:version | 2549648207 |
| wikibase:identifiers | 2 |
| wikibase:sitelinks | 5 |
| wikibase:statements | 6 |
| p:P1269 | wd:statement/Q25303632-61004926-42d8-debe-42f8-d59dc1143a58 |
| p:P138 | wd:statement/Q25303632-221c68e6-496a-b21a-ab7a-754461dc9ab0 |
| p:P2671 | wd:statement/Q25303632-427A0B0C-AD73-448A-B8B4-6180D920541E |
| p:P2812 | wd:statement/Q25303632-5832BEFB-039D-40B7-B60D-EE3AC7C6FBCF |
| p:P31 | wd:statement/Q25303632-f86f3eb6-44f8-c078-c23a-f0d904fabc3b |
| p:P6104 | wd:statement/Q25303632-BCD4CF31-6ACC-4F3F-83EF-E68783F8DFC4 |
|
p:direct- |
<http:/ |
| wdt:P1269 | graph drawing |
| wdt:P138 | Pál Turán |
| wdt:P2671 | "/g/11bzt4zs3y" |
| wdt:P2812 | "ZarankiewiczsConjecture" |
| wdt:P31 | mathematical problem |
| wdt:P6104 | WikiProject Mathematics |
Download as: