On the minimum number of edge‐disjoint complete <i>m</i>‐partite subgraphs into which <i>K<sub>n</sub></i> can be decomposed (Q4285594)
From MaRDI portal
scientific article; zbMATH DE number 529827
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the minimum number of edge‐disjoint complete <i>m</i>‐partite subgraphs into which <i>K<sub>n</sub></i> can be decomposed |
scientific article; zbMATH DE number 529827 |
Statements
On the minimum number of edge‐disjoint complete <i>m</i>‐partite subgraphs into which <i>K<sub>n</sub></i> can be decomposed (English)
0 references
15 September 1994
0 references
complete graph
0 references
subgraph
0 references
decomposition
0 references
