Abstract
It has been conjectured by Alspach [2] that given integers n and
m1, …, mt with
3 [les ] mi [les ] n and
[sum ]ti=1mi
= (n2) (n odd) or
[sum ]ti=1mi
= (n2) − n/2 (n even), then one can pack
Kn (n odd) or Kn minus a 1-factor
(n even) with cycles of lengths m1, …, mt.
In this paper we show that if the cycle lengths mi are bounded by some linear function
of n and n is sufficiently large then this conjecture is true.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献