Isomorphic factorisations III: Complete multipartite graphs

Frank Harary, Robert W Robinson, Nicholas C Wormald

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch


In the first paper of this series we showed that a factorisation of the complete graph Kp into t isomorphic subgraphs exists whenever the Divisibility Condition holds, that is, the number of lines is divisible by t. Our present objective is to investigate for complete multipartite graphs the extent to which the Divisibility Condition implies the existence of an isomorphic factorisation. We find that this is indeed the situation for all complete bipartite graphs but not for all k-partite graphs when k ≥ 3.
Original languageEnglish
Title of host publicationCombinatorial Mathematics
Subtitle of host publicationProceedings of the International Conference on Combinatorial Theory Canberra, August 16-27, 1977
EditorsD A Holton, Jennifer Seberry
Place of PublicationBerlin Germany
Number of pages8
Publication statusPublished - 1978
Externally publishedYes

Publication series

NameLecture Notes in Mathematics

Cite this