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

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

It is proved that $K_{2rs} $ cannot be edge-partitioned into copies of $K_{r,s} $ if $r$ and $s$ are greater than one. This answers a question raised in a recent paper of Granville, Moisiadis, and Rees. [Congr. Numer., 61 (1988), pp. 241-248].

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on discrete mathematics 1989-02, Vol.2 (1), p.48-50
Hauptverfasser: De Caen, D., Hoffman, D. G.
Format: Artikel
Sprache:eng
Schlagworte:
Decomposition
Euclidean space
Graphs
Tournaments & championships
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:It is proved that $K_{2rs} $ cannot be edge-partitioned into copies of $K_{r,s} $ if $r$ and $s$ are greater than one. This answers a question raised in a recent paper of Granville, Moisiadis, and Rees. [Congr. Numer., 61 (1988), pp. 241-248].
ISSN:0895-4801
1095-7146
DOI:10.1137/0402005