See dismantlable on Wiktionary
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "dismantle",
"3": "able"
},
"expansion": "dismantle + -able",
"name": "suffix"
}
],
"etymology_text": "From dismantle + -able.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "dismantlable (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"_dis1": "0 0 0",
"word": "dismantlability"
}
],
"senses": [
{
"categories": [
{
"_dis": "55 28 17",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "53 28 19",
"kind": "other",
"name": "English terms suffixed with -able",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "53 31 16",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "60 27 14",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"Capable of being dismantled, or taken apart."
],
"id": "en-dismantlable-en-adj-y8ucreEk",
"links": [
[
"dismantle",
"dismantle"
],
[
"taken apart",
"take apart"
]
],
"synonyms": [
{
"word": "demountable"
},
{
"word": "dismantleable"
}
],
"tags": [
"not-comparable"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Set theory",
"orig": "en:Set theory",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"The property of an ordered set such that its elements can be listed in an order such that, for every element, the element is irreducible (has exactly one upper or lower cover) in the subset consisting of that element and all subsequent elements."
],
"id": "en-dismantlable-en-adj-h8POmCcG",
"links": [
[
"set theory",
"set theory"
],
[
"ordered",
"ordered"
],
[
"set",
"set"
],
[
"element",
"element"
],
[
"irreducible",
"irreducible"
],
[
"cover",
"cover"
]
],
"raw_glosses": [
"(set theory) The property of an ordered set such that its elements can be listed in an order such that, for every element, the element is irreducible (has exactly one upper or lower cover) in the subset consisting of that element and all subsequent elements."
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences",
"set-theory"
]
},
{
"categories": [
{
"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"
}
],
"examples": [
{
"ref": "2015, Michal Adamaszek, “A note on independence complexes of chordal graphs and dismantling”, in arXiv:",
"text": "We show that the independence complex of a chordal graph is contractible if and only if this complex is dismantlable (strong collapsible) and it is homotopy equivalent to a sphere if and only if its core is a cross-polytopal sphere.",
"type": "quote"
}
],
"glosses": [
"The property of a graph such that its vertices can be listed in an order such that, for every vertex, the vertex is a subdominant vertex (has an adjacent vertex that is adjacent to every other vertex that it is adjacent to) in the induced subgraph generated by that vertex and all subsequent vertices."
],
"id": "en-dismantlable-en-adj--4b8Xvl5",
"links": [
[
"graph theory",
"graph theory"
],
[
"graph",
"graph"
],
[
"vertex",
"vertex"
],
[
"subdominant",
"subdominant"
],
[
"adjacent",
"adjacent"
]
],
"raw_glosses": [
"(graph theory) The property of a graph such that its vertices can be listed in an order such that, for every vertex, the vertex is a subdominant vertex (has an adjacent vertex that is adjacent to every other vertex that it is adjacent to) in the induced subgraph generated by that vertex and all subsequent vertices."
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "dismantlable"
}
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English terms suffixed with -able",
"English uncomparable adjectives",
"Pages with 1 entry",
"Pages with entries"
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "dismantle",
"3": "able"
},
"expansion": "dismantle + -able",
"name": "suffix"
}
],
"etymology_text": "From dismantle + -able.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "dismantlable (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"word": "dismantlability"
}
],
"senses": [
{
"glosses": [
"Capable of being dismantled, or taken apart."
],
"links": [
[
"dismantle",
"dismantle"
],
[
"taken apart",
"take apart"
]
],
"synonyms": [
{
"word": "demountable"
},
{
"word": "dismantleable"
}
],
"tags": [
"not-comparable"
]
},
{
"categories": [
"en:Set theory"
],
"glosses": [
"The property of an ordered set such that its elements can be listed in an order such that, for every element, the element is irreducible (has exactly one upper or lower cover) in the subset consisting of that element and all subsequent elements."
],
"links": [
[
"set theory",
"set theory"
],
[
"ordered",
"ordered"
],
[
"set",
"set"
],
[
"element",
"element"
],
[
"irreducible",
"irreducible"
],
[
"cover",
"cover"
]
],
"raw_glosses": [
"(set theory) The property of an ordered set such that its elements can be listed in an order such that, for every element, the element is irreducible (has exactly one upper or lower cover) in the subset consisting of that element and all subsequent elements."
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences",
"set-theory"
]
},
{
"categories": [
"English terms with quotations",
"en:Graph theory"
],
"examples": [
{
"ref": "2015, Michal Adamaszek, “A note on independence complexes of chordal graphs and dismantling”, in arXiv:",
"text": "We show that the independence complex of a chordal graph is contractible if and only if this complex is dismantlable (strong collapsible) and it is homotopy equivalent to a sphere if and only if its core is a cross-polytopal sphere.",
"type": "quote"
}
],
"glosses": [
"The property of a graph such that its vertices can be listed in an order such that, for every vertex, the vertex is a subdominant vertex (has an adjacent vertex that is adjacent to every other vertex that it is adjacent to) in the induced subgraph generated by that vertex and all subsequent vertices."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"graph",
"graph"
],
[
"vertex",
"vertex"
],
[
"subdominant",
"subdominant"
],
[
"adjacent",
"adjacent"
]
],
"raw_glosses": [
"(graph theory) The property of a graph such that its vertices can be listed in an order such that, for every vertex, the vertex is a subdominant vertex (has an adjacent vertex that is adjacent to every other vertex that it is adjacent to) in the induced subgraph generated by that vertex and all subsequent vertices."
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "dismantlable"
}
Download raw JSONL data for dismantlable meaning in All languages combined (3.0kB)
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-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). 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.