See Eulertur on Wiktionary
Download JSON data for Eulertur meaning in All languages combined (4.0kB)
{
"forms": [
{
"form": "no-table-tags",
"source": "declension",
"tags": [
"table-tags"
]
},
{
"form": "da-decl",
"source": "declension",
"tags": [
"inflection-template"
]
},
{
"form": "Eulertur",
"source": "declension",
"tags": [
"indefinite",
"nominative",
"singular"
]
},
{
"form": "Eulerturen",
"source": "declension",
"tags": [
"definite",
"nominative",
"singular"
]
},
{
"form": "Eulerture",
"source": "declension",
"tags": [
"indefinite",
"nominative",
"plural"
]
},
{
"form": "Eulerturene",
"source": "declension",
"tags": [
"definite",
"nominative",
"plural"
]
},
{
"form": "Eulerturs",
"source": "declension",
"tags": [
"genitive",
"indefinite",
"singular"
]
},
{
"form": "Eulerturens",
"source": "declension",
"tags": [
"definite",
"genitive",
"singular"
]
},
{
"form": "Eulertures",
"source": "declension",
"tags": [
"genitive",
"indefinite",
"plural"
]
},
{
"form": "Eulerturenes",
"source": "declension",
"tags": [
"definite",
"genitive",
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "da",
"10": "Eulertur",
"11": "",
"12": "{{{pl-indef-2}}}",
"13": "",
"14": "{{{com}}}",
"2": "noun",
"3": "",
"4": "{{{1}}}",
"5": "",
"6": "{{{sg-def-2}}}",
"7": "",
"8": "",
"9": "",
"f1accel-form": "def|s",
"f4accel-form": "indef|p",
"g": "",
"g2": "",
"head": ""
},
"expansion": "Eulertur",
"name": "head"
},
{
"args": {},
"expansion": "Eulertur",
"name": "da-noun"
}
],
"inflection_templates": [
{
"args": {
"1": "en",
"2": "e"
},
"name": "da-decl"
},
{
"args": {
"g": "c",
"gen-pl-def": "Eulerturenes",
"gen-pl-def-2": "",
"gen-pl-def-3": "",
"gen-pl-indef": "Eulertures",
"gen-pl-indef-2": "",
"gen-sg-def": "Eulerturens",
"gen-sg-def-2": "",
"gen-sg-indef": "Eulerturs",
"gen-sg-indef-2": "",
"gen-sg-indef-3": "",
"pl-def": "Eulerturene",
"pl-def-2": "",
"pl-def-3": "",
"pl-indef": "Eulerture",
"pl-indef-2": "",
"pl-indef-3": "",
"sg-def": "Eulerturen",
"sg-def-2": "",
"sg-indef": "Eulertur"
},
"name": "da-noun-infl-base"
}
],
"lang": "Danish",
"lang_code": "da",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "Danish entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "da",
"name": "Graph theory",
"orig": "da:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"english": "1) If there exists a closed Eulerian trail through the graph G, then all nodes in G have even degree. 2) If all nodes in G have even degree, then there exists a closed Eulerian trail through the graph.",
"ref": "year unknown, K. Jess, J. Skott, H.C. Hansen og J. Schou, Kristine Jess, Matematik for Laererstuderende, Samfundslitteratur →ISBN, page 355",
"text": "1) Hvis der findes en lukket Eulertur gennem grafen G, så har alle knudepunkter i G lige valens. 2) Hvis alle punkter i G har lige valens, så findes der en lukket Eulertur gennem grafen."
},
{
"english": "Euler had great difficulties devising an Eulerian trail, not the least if he wanted to start and end in his home - that is, walk a closed Eulerian trail.",
"ref": "2007, Matematik for lærerstuderende : ypsilon : basisbog, Samfundslitteratur, page 47",
"text": "Euler havde store vanskeligheder med at gå en Eulertur, ikke mindst hvis han ville starte og slutte i sit hjem - altså gå en lukket Eulertur.",
"type": "quotation"
},
{
"ref": "2005, Gyldendals Minilex. Matematik, Gyldendal Uddannelse, page 104",
"text": "Det ville svare til, at nedenstående graf har en ▻Eulertur, hvilket den ikke har, idet ikke hvert hjørne har lige valens: ...\nThis would be equivalent to saying that the graph below has an ▻Eulerian trail, which it does not, as not every node has even degree: ...",
"type": "quotation"
}
],
"glosses": [
"Eulerian trail"
],
"id": "en-Eulertur-da-noun-un357tKG",
"links": [
[
"graph theory",
"graph theory"
],
[
"Eulerian trail",
"Eulerian trail"
]
],
"raw_glosses": [
"(graph theory) Eulerian trail"
],
"related": [
{
"word": "Eulergraf"
}
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "Eulertur"
}
{
"forms": [
{
"form": "no-table-tags",
"source": "declension",
"tags": [
"table-tags"
]
},
{
"form": "da-decl",
"source": "declension",
"tags": [
"inflection-template"
]
},
{
"form": "Eulertur",
"source": "declension",
"tags": [
"indefinite",
"nominative",
"singular"
]
},
{
"form": "Eulerturen",
"source": "declension",
"tags": [
"definite",
"nominative",
"singular"
]
},
{
"form": "Eulerture",
"source": "declension",
"tags": [
"indefinite",
"nominative",
"plural"
]
},
{
"form": "Eulerturene",
"source": "declension",
"tags": [
"definite",
"nominative",
"plural"
]
},
{
"form": "Eulerturs",
"source": "declension",
"tags": [
"genitive",
"indefinite",
"singular"
]
},
{
"form": "Eulerturens",
"source": "declension",
"tags": [
"definite",
"genitive",
"singular"
]
},
{
"form": "Eulertures",
"source": "declension",
"tags": [
"genitive",
"indefinite",
"plural"
]
},
{
"form": "Eulerturenes",
"source": "declension",
"tags": [
"definite",
"genitive",
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "da",
"10": "Eulertur",
"11": "",
"12": "{{{pl-indef-2}}}",
"13": "",
"14": "{{{com}}}",
"2": "noun",
"3": "",
"4": "{{{1}}}",
"5": "",
"6": "{{{sg-def-2}}}",
"7": "",
"8": "",
"9": "",
"f1accel-form": "def|s",
"f4accel-form": "indef|p",
"g": "",
"g2": "",
"head": ""
},
"expansion": "Eulertur",
"name": "head"
},
{
"args": {},
"expansion": "Eulertur",
"name": "da-noun"
}
],
"inflection_templates": [
{
"args": {
"1": "en",
"2": "e"
},
"name": "da-decl"
},
{
"args": {
"g": "c",
"gen-pl-def": "Eulerturenes",
"gen-pl-def-2": "",
"gen-pl-def-3": "",
"gen-pl-indef": "Eulertures",
"gen-pl-indef-2": "",
"gen-sg-def": "Eulerturens",
"gen-sg-def-2": "",
"gen-sg-indef": "Eulerturs",
"gen-sg-indef-2": "",
"gen-sg-indef-3": "",
"pl-def": "Eulerturene",
"pl-def-2": "",
"pl-def-3": "",
"pl-indef": "Eulerture",
"pl-indef-2": "",
"pl-indef-3": "",
"sg-def": "Eulerturen",
"sg-def-2": "",
"sg-indef": "Eulertur"
},
"name": "da-noun-infl-base"
}
],
"lang": "Danish",
"lang_code": "da",
"pos": "noun",
"related": [
{
"word": "Eulergraf"
}
],
"senses": [
{
"categories": [
"Danish entries with incorrect language header",
"Danish lemmas",
"Danish nouns",
"Danish terms with quotations",
"da:Graph theory"
],
"examples": [
{
"english": "1) If there exists a closed Eulerian trail through the graph G, then all nodes in G have even degree. 2) If all nodes in G have even degree, then there exists a closed Eulerian trail through the graph.",
"ref": "year unknown, K. Jess, J. Skott, H.C. Hansen og J. Schou, Kristine Jess, Matematik for Laererstuderende, Samfundslitteratur →ISBN, page 355",
"text": "1) Hvis der findes en lukket Eulertur gennem grafen G, så har alle knudepunkter i G lige valens. 2) Hvis alle punkter i G har lige valens, så findes der en lukket Eulertur gennem grafen."
},
{
"english": "Euler had great difficulties devising an Eulerian trail, not the least if he wanted to start and end in his home - that is, walk a closed Eulerian trail.",
"ref": "2007, Matematik for lærerstuderende : ypsilon : basisbog, Samfundslitteratur, page 47",
"text": "Euler havde store vanskeligheder med at gå en Eulertur, ikke mindst hvis han ville starte og slutte i sit hjem - altså gå en lukket Eulertur.",
"type": "quotation"
},
{
"ref": "2005, Gyldendals Minilex. Matematik, Gyldendal Uddannelse, page 104",
"text": "Det ville svare til, at nedenstående graf har en ▻Eulertur, hvilket den ikke har, idet ikke hvert hjørne har lige valens: ...\nThis would be equivalent to saying that the graph below has an ▻Eulerian trail, which it does not, as not every node has even degree: ...",
"type": "quotation"
}
],
"glosses": [
"Eulerian trail"
],
"links": [
[
"graph theory",
"graph theory"
],
[
"Eulerian trail",
"Eulerian trail"
]
],
"raw_glosses": [
"(graph theory) Eulerian trail"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "Eulertur"
}
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-24 from the enwiktionary dump dated 2024-05-02 using wiktextract (46b31b8 and c7ea76d). 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.