On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform-length cycles

被引:1
|
作者
Francetic, Nevena [1 ]
Sajna, Mateja [1 ]
机构
[1] Univ Ottawa, Dept Math & Stat, 150 Louis Pasteur Private, Ottawa, ON K1N 6N5, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
complete symmetric equipartite digraph; directed Oberwolfach problem; resolvable directed cycle decomposition; 2-FACTORIZATIONS;
D O I
10.1002/jcd.21913
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We examine the necessary and sufficient conditions for a complete symmetric equipartite digraph Kn[m]* ${K}_{n[m]}<^>{* }$ with n $n$ parts of size m $m$ to admit a resolvable decomposition into directed cycles of length t $t$. We show that the obvious necessary conditions are sufficient for m,n,t & GE;2 $m,n,t\ge 2$ in each of the following four cases: (i) m(n-1) $m(n-1)$ is even; (ii) gcd(m,n)& NI;{1,3} $\text{gcd}(m,n)\notin \{1,3\}$; (iii) gcd(m,n)=1 $\text{gcd}(m,n)=1$ and 4 divide n $4| n$ or 6 divide n $6| n$; and (iv) gcd(m,n)=3 $\text{gcd}(m,n)=3$, and if n=6 $n=6$, then p divide m $p| m$ for a prime p & LE;37 $p\le 37$.
引用
收藏
页码:604 / 641
页数:38
相关论文
共 23 条