Impossibility of Decomposing the Complete Graph on n Points into n - 1 Isomorphic Complete Bipartite Graphs

DOI10.1137/0402005MaRDI QIDQ3828037zbMATH OpenOpenAlexFDO

Authors D. de Cean, D. G. Hoffmann

Publication date 1989

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0402005

zbMATH Keywords

decomposition of complete graphedge-partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decomposition of complete graphs into isomorphic complete bipartite graphs
• On biclique partitions of the complete graph
• scientific article; zbMATH DE number 4093503
• scientific article; zbMATH DE number 4057555
• On the decomposition of K_n into complete m‐partite graphs

Cited in

(11)

• Decompositions of complete multipartite graphs
• On tournament matrices
• Algebraic multiplicity of the eigenvalues of a tournament matrix
• On biclique decompositions of complete \(t\)-partite graphs
• Tournament matrices and their generalizations, I.
• A survey on the existence ofG-Designs
• Problems and invariants connected with bicliques and multicliques of graphs
• Decomposition of complete graphs into isomorphic complete bipartite graphs
• Complete bipartite decompositions of crowns, with applications to complete directed graphs
• Decomposing complete graphs into isomorphic complete multipartite graphs
• On biclique partitions of the complete graph

This page was built for publication: Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs

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