On the minimum number of edge‐disjoint complete m‐partite subgraphs into which Kn can be decomposed

DOI10.1002/JGT.3190170609MaRDI QIDQ4285594zbMATH OpenOpenAlexFDO

Authors Qingxue Huang

Publication date 15 September 1994

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190170609

zbMATH Keywords

complete graphdecompositionsubgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the decomposition of K_n into complete m‐partite graphs
• scientific article; zbMATH DE number 4008444
• scientific article; zbMATH DE number 3841905
• scientific article; zbMATH DE number 1109398
• Complete multipartite decompositions of complete graphs and complete n-partite graphs
• On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
• When all minimal \(k\)-vertex separators induce complete or edgeless subgraphs
• On k-partite subgraphs
• Sharp bounds for decompositions of graphs into completer-partite subgraphs
• On large sets of \(K_{1, p}\)-decomposition of complete bipartite graphs

Cited in

(4)

• Complete multipartite decompositions of complete graphs and complete n-partite graphs
• Maximum number of vertex-disjoint complete subgraphs
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• On the decomposition of K_n into complete m‐partite graphs

This page was built for publication: On the minimum number of edge‐disjoint complete m‐partite subgraphs into which K_n can be decomposed

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285594)