Concept information
Terme préférentiel
Graham-Pollak theorem
Définition(s)
-
In graph theory, the Graham–Pollak theorem states that the edges of an n-vertex complete graph cannot be partitioned into fewer than n − 1 complete bipartite graphs. It was first published by Ronald Graham and Henry O. Pollak in two papers in 1971 and 1972 (crediting Hans Witsenhausen for a key lemma), in connection with an application to telephone switching circuitry.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Graham%E2%80%93Pollak_theorem)
Concept(s) générique(s)
Traductions
-
français
URI
http://data.loterre.fr/ark:/67375/PSR-W036BQX4-N
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}