...
首页> 外文期刊>Ars Combinatoria: An Australian-Canadian Journal of Combinatorics >Smallest weak and smallest totally weak critical sets in the latin squares of order at most seven
【24h】

Smallest weak and smallest totally weak critical sets in the latin squares of order at most seven

机译:最多七个阶的拉丁方中的最小弱和最小全弱临界集

获取原文
获取原文并翻译 | 示例

摘要

A critical set in a latin square of order n is a set of entries in a latin square which can be embedded in precisely one latin square of order n. Also, if any element of the critical set is deleted, the remaining set can be embedded in more than one latin square of order n. In this paper we find smallest weak and smallest totally weak critical sets for all the latin squares of orders six and seven. Moreover, we computationally prove that there is no (totally) weak critical set in the back circulant latin square of order five and we find a totally weak critical set of size seven in the other main class of latin squares of order five.
机译:n阶拉丁方中的一个关键集合是一个拉丁方平方中的一组条目,这些项可以精确地嵌入n阶一个拉丁方中。同样,如果删除了关键集合的任何元素,则其余集合可以嵌入n个以上的多个拉丁方。在本文中,我们发现所有六阶和七阶拉丁方的最小弱和最小全弱临界集。此外,我们通过计算证明了在五阶的反循环拉丁方中没有(完全)弱临界集,并且在其他五阶拉丁方类中发现了大小为7的完全弱临界集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号