See graphe parfait on Wiktionary
{
"categories": [
{
"kind": "other",
"name": "Compositions en français",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Locutions nominales en français",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Traductions en anglais",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Traductions en italien",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Français",
"orig": "français",
"parents": [],
"source": "w"
}
],
"etymology_texts": [
"Composé de graphe et de parfait."
],
"forms": [
{
"form": "graphes parfaits",
"tags": [
"plural"
]
}
],
"lang": "Français",
"lang_code": "fr",
"pos": "noun",
"pos_title": "Locution nominale",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "Exemples en français",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Lexique en français de la théorie des graphes",
"parents": [],
"source": "w"
}
],
"examples": [
{
"ref": "Mathématiques et sciences humaines, Numéros 158 à 163, École des hautes études en sciences sociales, 2002",
"text": "Un graphe est parfait, si et seulement si, il ne comporte ni trou impair ni antitrou impair : ceci est présumé vrai : ceci est la conjecture du graphe parfait de Berge."
}
],
"glosses": [
"Graphe pour lequel sont égaux le nombre chromatique de chaque sous-graphe induit, et la taille de la plus grande clique dudit sous-graphe induit."
],
"id": "fr-graphe_parfait-fr-noun-UYPEbt4I",
"raw_tags": [
"Théorie des graphes"
]
}
],
"sounds": [
{
"ipa": "\\ɡʁaf paʁ.fɛ\\"
},
{
"audio": "LL-Q150 (fra)-Lepticed7-graphe parfait.wav",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/4b/LL-Q150_(fra)-Lepticed7-graphe_parfait.wav/LL-Q150_(fra)-Lepticed7-graphe_parfait.wav.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/4b/LL-Q150_(fra)-Lepticed7-graphe_parfait.wav/LL-Q150_(fra)-Lepticed7-graphe_parfait.wav.ogg",
"raw_tags": [
"France (Toulouse)"
],
"wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q150 (fra)-Lepticed7-graphe parfait.wav"
}
],
"tags": [
"masculine"
],
"translations": [
{
"lang": "Anglais",
"lang_code": "en",
"word": "perfect graph"
},
{
"lang": "Italien",
"lang_code": "it",
"tags": [
"masculine"
],
"word": "grafo perfetto"
}
],
"word": "graphe parfait"
}
{
"categories": [
"Compositions en français",
"Locutions nominales en français",
"Traductions en anglais",
"Traductions en italien",
"français"
],
"etymology_texts": [
"Composé de graphe et de parfait."
],
"forms": [
{
"form": "graphes parfaits",
"tags": [
"plural"
]
}
],
"lang": "Français",
"lang_code": "fr",
"pos": "noun",
"pos_title": "Locution nominale",
"senses": [
{
"categories": [
"Exemples en français",
"Lexique en français de la théorie des graphes"
],
"examples": [
{
"ref": "Mathématiques et sciences humaines, Numéros 158 à 163, École des hautes études en sciences sociales, 2002",
"text": "Un graphe est parfait, si et seulement si, il ne comporte ni trou impair ni antitrou impair : ceci est présumé vrai : ceci est la conjecture du graphe parfait de Berge."
}
],
"glosses": [
"Graphe pour lequel sont égaux le nombre chromatique de chaque sous-graphe induit, et la taille de la plus grande clique dudit sous-graphe induit."
],
"raw_tags": [
"Théorie des graphes"
]
}
],
"sounds": [
{
"ipa": "\\ɡʁaf paʁ.fɛ\\"
},
{
"audio": "LL-Q150 (fra)-Lepticed7-graphe parfait.wav",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/4b/LL-Q150_(fra)-Lepticed7-graphe_parfait.wav/LL-Q150_(fra)-Lepticed7-graphe_parfait.wav.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/4b/LL-Q150_(fra)-Lepticed7-graphe_parfait.wav/LL-Q150_(fra)-Lepticed7-graphe_parfait.wav.ogg",
"raw_tags": [
"France (Toulouse)"
],
"wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q150 (fra)-Lepticed7-graphe parfait.wav"
}
],
"tags": [
"masculine"
],
"translations": [
{
"lang": "Anglais",
"lang_code": "en",
"word": "perfect graph"
},
{
"lang": "Italien",
"lang_code": "it",
"tags": [
"masculine"
],
"word": "grafo perfetto"
}
],
"word": "graphe parfait"
}
Download raw JSONL data for graphe parfait meaning in All languages combined (1.7kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-30 from the frwiktionary dump dated 2025-01-20 using wiktextract (bcd5c38 and 9dbd323). 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.