期刊文献+

可分解Mendelsohn三元系的相交数 被引量:2

Intersection Numbers of Resolvable Mendelsohn Triple Systems
下载PDF
导出
摘要 证明了对于任意的正整数 v≡ 0 (mod 3) ,v≥ 63,存在两个 v阶可分解 Mendelsohn三元系相交于 s个公共循环三元组的充分必要条件是 s∈ { 0 ,1 ,… ,tv- 6,tv- 4 ,tv} ,其中 tv=v(v- 1 ) / 3. It was proved that for any v≡0 (mod 3) and v ≥63, there exist two resolvable Mendelsohn triple systems of order v intersecting in s triples if and only if s∈(0,1,…,t v-6,t v-4,t v }, where t v=v(v-1)/3 .
作者 沈灏 刘振
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2003年第2期298-302,共5页 Journal of Shanghai Jiaotong University
基金 国家自然科学基金资助项目 ( 1 9831 0 50 )
关键词 可分解Mendelsohn三元系 相交数 MENDELSOHN FRAME 不完全Medndlsohn三元系 resolvable Mendelsohn triple system intersection number Mendelsohn frame incomplete Mendelsohn triple system
  • 相关文献

参考文献3

  • 1Hoffman D G, Lindner C C. Mendelsohn triple systems having a prescribed number of triples in common[J]. Europ J Combin,1982,3:51-61.
  • 2沈灏,刘振.可分解Mendelsohn三元系的相交数[J].上海交通大学学报,2003,37(2):298-302. 被引量:2
  • 3Shen H. Embeddings of resolvable and almost resolvable Mendelsohn triple system(Abstract)[A]. ICM 2002 Beijing-Abstracts of Short Communications and Poster Sessions[C].Beijing: Higher Education Press,2002.

二级参考文献3

  • 1Hoffman D G, Lindner C C. Mendelsohn triple systems having a prescribed number of triples in common[J]. Europ J Combin,1982,3:51-61.
  • 2Shen H. Embeddings of resolvable and almost resolvable Mendelsohn triple system(Abstract)[A]. ICM 2002 Beijing-Abstracts of Short Communications and Poster Sessions[C].Beijing: Higher Education Press,2002.
  • 3沈灏,刘振.可分解Mendelsohn三元系的相交数[J].上海交通大学学报,2003,37(2):298-302. 被引量:2

共引文献1

同被引文献9

  • 1顾宗敏,沈灏.双循环Kirkman三元系的存在性[J].上海交通大学学报,2005,39(10):1722-1726. 被引量:3
  • 2Hoffman D G, Lindner C C. Mendelsohn triple systems having a prescribed number of triples in common[J]. Europ J Combin,1982,3:51-61.
  • 3Shen H. Embeddings of resolvable and almost resolvable Mendelsohn triple system(Abstract)[A]. ICM 2002 Beijing-Abstracts of Short Communications and Poster Sessions[C].Beijing: Higher Education Press,2002.
  • 4Linder C C,Rodger C A.Decompositions into cycles.Ⅱ.Cycle systems,contemporary design theory[M].[s.l.]:John Wiley & Sons Inc,1992:325-369.
  • 5Alspach B,Gavlas H.Cycle decompositions of Kn and Kn-I[J].Journal of Combinatorial Theory.Series B,2001,81(1):77-99.
  • 6Sotteau D.Decompositions of Km,n (Km^*,n) into cycles (circuits) of length 2k[J].Journal of Combinatorial Theory.Series B,1981,30(1):75-81.
  • 7Saajna M.Cycle decompositions.Ⅲ.Complete graphs and fixed length cycles[J].Journal of Combinatorial Designs,2002,10(1):27-78.
  • 8Wu S L.Even (m1,m2,…,mr)-cycle systems of the complete graph[J].Ars Comb,2004,70(1):219-223.
  • 9Fu H L,Wu S L.Cyclically decomposing the complete graph into cycles[J].Discrete Math,2004,282(1-3):167-173.

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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