Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19

Discrete Mathematics(2011)

引用 6|浏览14
暂无评分
摘要
A Hanani triple system of order 6n+1, HATS(6n+1), is a decomposition of the complete graph K\"6\"n\"+\"1 into 3n sets of 2n disjoint triangles and one set of n disjoint triangles. A nearly Kirkman triple system of order 6n, NKTS(6n), is a decomposition of K\"6\"n-F into 3n-1 sets of 2n disjoint triangles; here F is a one-factor of K\"6\"n. The Hanani triple systems of order 6n+1 and the nearly Kirkman triple systems of order 6n can be classified using the classification of the Steiner triple systems of order 6n+1. This is carried out here for n=3: There are 3787983639 isomorphism classes of HATS(19)s and 25328 isomorphism classes of NKTS(18)s. Several properties of the classified systems are tabulated. In particular, seven of the NKTS(18)s have orthogonal resolutions, and five of the HATS(19)s admit a pair of resolutions in which the almost parallel classes are orthogonal.
更多
查看译文
关键词
steiner triple system,resolvable design,nearly kirkman triple system,hanani triple system,complete graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要