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

DOI10.1137/0402005zbMath0674.05051OpenAlexW2021597307MaRDI QIDQ3828037

D. G. Hoffmann, D. de Cean

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

edge-partitiondecomposition of complete graph

Mathematics Subject Classification ID

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

Related Items (8)

Unnamed Item ⋮ Tournament matrices and their generalizations, I. ⋮ A survey on the existence ofG-Designs ⋮ On tournament matrices ⋮ Algebraic multiplicity of the eigenvalues of a tournament matrix ⋮ On biclique partitions of the complete graph ⋮ Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs ⋮ On biclique decompositions of complete \(t\)-partite graphs

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