科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let v >= k >= 1 and lambda >= 0 be integers. Recall that a (v, k, lambda) block design is a collection B of k-subsets of a v-set X in which every unordered pair of elements in X is contained in exactly lambda of the subsets in B. Now let G be a graph with no multiple edges. A ( v, G, lambda) graph design is a collection H of subgraphs, each isomoprhic to G, of the complete graph K(v) such that each edge of K(v) appears in exactly lambda of the subgraphs in H. A famous result of Wilson states that for a fixed simple graph G and integer lambda, there exists a (v, G, lambda) graph design for all sufficiently large integers v satisfying certain necessary conditions. Here, we extend this result to include the case of loops in G. As a consequence, we obtain the asymptotic existence of equireplicate graph designs. Applications of the equireplicate condition are given.
- 出版日期2011-7
