Sharp bounds for decompositions of graphs into completer-partite subgraphs

DOI10.1002/(SICI)1097-0118(199604)21:4%3C393::AID-JGT4%3E3.0.CO;2-KMaRDI QIDQ4879175zbMATH OpenOpenAlexFDO

Authors D. A. Gregory, Kevin N. Vander Meulen

Publication date 8 July 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199604)21:4%3C393::aid-jgt4%3E3.0.co;2-k

zbMATH Keywords

edge coverseigenvalueslower boundmultipartite subgraphspartition

Mathematics Subject Classification ID

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

Recommendations

• Decomposition of the complete r-graph into complete r-partite r-graphs
• Sharp bounds for decomposing graphs into edges and triangles
• scientific article; zbMATH DE number 3841905
• Complete Subgraphs of r-partite Graphs
• Complete \(r\)-partite subgraphs of dense \(r\)-graphs
• On the decomposition of K_n into complete m‐partite graphs
• Decompositions of complete multipartite graphs
• Complete multipartite decompositions of complete graphs and complete n-partite graphs
• scientific article; zbMATH DE number 1109398
• On the decomposition of graphs into complete bipartite graphs

Cited in

(9)

• On the line graphs of the complete r-partite graphs
• Decomposition of the complete r-graph into complete r-partite r-graphs
• Skew rank decompositions
• Eigenvalues and clique partitions of graphs
• A linear programming formulation for the maximum complete multipartite subgraph problem
• More on the bipartite decomposition of random graphs
• On the minimum number of edge‐disjoint complete m‐partite subgraphs into which K_n can be decomposed
• Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
• On a symmetric representation of Hermitian matrices and its applications to graph theory

This page was built for publication: Sharp bounds for decompositions of graphs into completer-partite subgraphs

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