Partial Latin Squares Are Avoidable

被引：0

作者：

Lars-Daniel Öhman

机构：

[1] Umeå University,Department of Mathematics and Mathematical Statistics

来源：

Annals of Combinatorics | 2011年 / 15卷

关键词：

05B15; Latin square; partial Latin square; avoidable array;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

A square array is avoidable if for each set of n symbols there is an n × n Latin square on these symbols which differs from the array in every cell. The main result of this paper is that for m ≥ 2 any partial Latin square of order 4m − 1 is avoidable, thus concluding the proof that any partial Latin square of order at least 4 is avoidable.

引用

页码：485 / 497

页数：12

共 6 条

[1]

Cavenagh N.J.(2010)Avoidable partial Latin squares of order 4 Ars Combin. 95 257-275

[2]

Chetwynd A.G.(1995) + 1 Discrete Math. 141 47-59

[3]

Rhodes S.J.(1997)Chessboard squares Discrete Math. 177 17-32

[4]

Chetwynd A.G.(1989)Avoiding partial Latin squares and intricacy Discrete Math. 75 253-254

[5]

Rhodes S.J.(undefined)A note on Latin squares with restricted support undefined undefined undefined-undefined

[6]

Häggkvist R.(undefined)undefined undefined undefined undefined-undefined

← 1 →