Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T02:10:03.772Z Has data issue: false hasContentIssue false

Decomposition of Kn into Dragons

Published online by Cambridge University Press:  20 November 2018

C. Huang
Affiliation:
Carleton University, Ottawa, K1S 5B6, Department of Mathematical Sciences, Tel-Aviv University, Tel-Aviv
J. Schonheim
Affiliation:
Carleton University, Ottawa, K1S 5B6, Department of Mathematical Sciences, Tel-Aviv University, Tel-Aviv
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

It is shown that if 1<n ≡ 0 or 1 (mod 2 m), then the edges of Kn may be partitioned into isomorphic copies of a graph D 3(m) and also of a graph D 4(m), graphs consisting respectively of a triangle with an attached path of m - 3 edges or a quadrilateral with an attached path of m - 4 edges. If m is a power of 2 then the above condition is shown to be necessary and sufficient for the existence of such a partition.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1980