期刊文献+

拟Kirkman系的渐近存在性 被引量:1

原文传递
导出
摘要 我们在本文中证明,对任意给定的正整数k≥2,都存在常数v_0=v_0(k),使当v≥v_0时,拟Kirkman系NKS(2,k;v)存在的必要条件v≡0(mod k(k-1))也是充分的。从而解决了拟Kirkman系的渐近存在性问题。
作者 沈灏 储文松
出处 《中国科学(A辑)》 CSCD 1994年第3期241-246,共6页 Science in China(Series A)
基金 国家自然科学基金
  • 相关文献

同被引文献22

  • 1Stinson D R, Vanstone S A. A combinatorial approach to threshold schemes. SIAM J Discrete Math, 1988, 1:230-236. 被引量:1
  • 2Abel R J R, Ge G, Yin J. Resolvable and near-resolvable designs. In: Colbourn C J, Dinitz J H, eds. The CRC Handbook of Combinatorial Designs. Boca Raton: CRC Press, 2007, 124-132. 被引量:1
  • 3Scheiienberg P J, Stinson D R. Threshold schemes from combinatorial designs. J Combin Math Combin Comput, 1989, 5:143-160. 被引量:1
  • 4Teirlinck L. A completion of Lu's determination of the spectrum of large sets of disjoint Steiner triple systems. J Combin Theory Ser A, 1991, 57:302-305. 被引量:1
  • 5Teirlinck L. Some new 2-resolvable Steiner quadruple systems. Des Codes Cryptogr, 1994, 4:5-10. 被引量:1
  • 6Cao H, Ji L, Zhu L. Large sets of disjoint packings on 6k q- 5 points. J Combin Theory Ser A, 2004, 108:169-183. 被引量:1
  • 7Cao H, Lei J, Zhu L. Large sets of disjoint group-divisible designs with block size three and type 2n41. J Combin Des, 2001, 9:285-296. 被引量:1
  • 8Cao H, Lei J, Zhu L. Further results on large sets of disjoint group-divisible designs with block size three and type 2n41. J Combin Des, 2003, 11:24-35. 被引量:1
  • 9Cao H, Lei J, Zhu L. Constructions of large sets of disjoint group-divisible designs Ls(2n41) using a generalization of *LS(2n). Discrete Math, in press, 2005. 被引量:1
  • 10Chen D, Lindner C C, Stinson D R. Further results on large sets of disjoint group-divisible designs. Discrete Math, 1992, 110:35-42. 被引量:1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部