$K_v$的最大$K_2K_3$填充设计

Abstract Let Kv be the complete graph on v vertices, and G a finite simple undirected graph without isolated vertices. A G-packing of Kv, denoted by （v, G, 1）-packing, is a pair （X,A） where X is the vertex set of K＋ and ＋4 is a family of edge-disjoint subgraphs isomorphic to G in Kv. In this paper, the maximum number of subgraphs in a （v, G, 1）-packing is determined when G is K2 x K3, the Cartesian product of K2 and K3, leaving two orders undetermined. This design originated from the use of DNA library screening.     

一个六点九边图的图设计

令Kv表示v个顶点的完全图,G是一个不含孤立点的简单连通图.一个v阶的G-设计是将Kv划分成互不相交的子图,使得每个子图都和G同构,记为G-GD(v).研究六点九边图G11的图设计存在性问题.利用标准的递推构造并结合必要的直接构造,证明除去G11-GD(9)不存在以及G11-GD(18)的存在性未知外,G11-GD(v...