剩余为几乎2-正则的6-圈系

Let Kn be a complete graph on n vertices. In this paper, we find the necessary conditions for the existence of a 6-cycle system of Kn - L for every nearly 2-regular leave L of Kn. This condition is also sufficient when the number of vertices of L is n - 4.     

图2Kv的可旋转(4,6)圈系

证明了图2Kv的可旋转（4，6）圈系存在的充分必要条件为：v≥10，v≡0，5（mod 10）．     

$F$为支撑森林的$K_{v}-F$的最大六圈填充

In this paper,we extend the result of packing the complete graph Kv with 6-cycles (hexagons).Mainly,the maximum packing of Kv F is obtained where the leave is an odd spanning forest.     

长为{3,4,5}的完备删位纠错码的组合构造

本文研究了混合长度的删位纠错码的构造问题.利用组合设计的方法构造了长为{3,4,5}的完备删位纠错码T(2,{3,4,5},v),当v为正整数且v≠8时,得到了所有的T(2,{3,4,5},v)-码,并给出码字总数的一个上界,T(2,{3,4,5},v)-码的构造推广了长度为单一值的删位纠错码的构造结果.