"Turán's brick factory problem" meaning in English

See Turán's brick factory problem in All languages combined, or Wiktionary

Proper name

Etymology: Named after Pál Turán, who formulated it while working in a brick factory during World War II. Head templates: {{en-prop}} Turán's brick factory problem
  1. (graph theory) The problem of finding the minimum number of crossings in a drawing of a complete bipartite graph. Categories (topical): Graph theory
    Sense id: en-Turán's_brick_factory_problem-en-name-kDtuR~Tc Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries Topics: graph-theory, mathematics, sciences
     
{
  "etymology_text": "Named after Pál Turán, who formulated it while working in a brick factory during World War II.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Turán's brick factory problem",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The problem of finding the minimum number of crossings in a drawing of a complete bipartite graph."
      ],
      "id": "en-Turán's_brick_factory_problem-en-name-kDtuR~Tc",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "minimum",
          "minimum"
        ],
        [
          "number",
          "number"
        ],
        [
          "crossing",
          "crossing"
        ],
        [
          "drawing",
          "drawing"
        ],
        [
          "complete",
          "complete"
        ],
        [
          "bipartite",
          "bipartite"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The problem of finding the minimum number of crossings in a drawing of a complete bipartite graph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Turán's brick factory problem"
}

{
  "etymology_text": "Named after Pál Turán, who formulated it while working in a brick factory during World War II.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Turán's brick factory problem",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms spelled with Á",
        "English terms spelled with ◌́",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "The problem of finding the minimum number of crossings in a drawing of a complete bipartite graph."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "minimum",
          "minimum"
        ],
        [
          "number",
          "number"
        ],
        [
          "crossing",
          "crossing"
        ],
        [
          "drawing",
          "drawing"
        ],
        [
          "complete",
          "complete"
        ],
        [
          "bipartite",
          "bipartite"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The problem of finding the minimum number of crossings in a drawing of a complete bipartite graph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Turán's brick factory problem"
}

Download raw JSONL data for Turán's brick factory problem meaning in English (1.1kB)

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-03-06 from the enwiktionary dump dated 2025-03-02 using wiktextract (b81b832 and 633533e). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.