"Euler genus" meaning in English

See Euler genus in All languages combined, or Wiktionary

Noun

Head templates: {{en-noun|?}} Euler genus
  1. (graph theory) The minimal integer n such that the given graph can be drawn without crossing itself on a sphere with n cross-caps or with n/2 handles. Categories (topical): Graph theory
{
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "Euler genus",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "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 minimal integer n such that the given graph can be drawn without crossing itself on a sphere with n cross-caps or with n/2 handles."
      ],
      "id": "en-Euler_genus-en-noun-8tYtUJke",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "minimal",
          "minimal"
        ],
        [
          "integer",
          "integer"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "sphere",
          "sphere"
        ],
        [
          "cross-cap",
          "cross-cap"
        ],
        [
          "handle",
          "handle"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The minimal integer n such that the given graph can be drawn without crossing itself on a sphere with n cross-caps or with n/2 handles."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Euler genus"
}
{
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "Euler genus",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English nouns with unknown or uncertain plurals",
        "English terms with non-redundant non-automated sortkeys",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "The minimal integer n such that the given graph can be drawn without crossing itself on a sphere with n cross-caps or with n/2 handles."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "minimal",
          "minimal"
        ],
        [
          "integer",
          "integer"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "sphere",
          "sphere"
        ],
        [
          "cross-cap",
          "cross-cap"
        ],
        [
          "handle",
          "handle"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The minimal integer n such that the given graph can be drawn without crossing itself on a sphere with n cross-caps or with n/2 handles."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Euler genus"
}

Download raw JSONL data for Euler genus 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 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.