toIPA
Home
Blog
Category
Turán's brick factory problem
finding the minimum number of crossings in a drawing of a complete bipartite graph
Pronunciation
/Turán's brɪk ˈfaktəri ˈprɒbləm/
/Turán's brɪk ˈfæktəri ˈprɑbləm/
Categories
mathematical problem