Avoidability by Latin squares of arrays of even order

• We prove that for any k and any 2k × 2k array A such that no cell in A contains more than   k/2550 symbols, and no symbol occurs more than k/2550 times in any row or column, there is a Latin square such that no 2550cell in the Latin square contains a symbol that occurs in the corresponding cell in A. This proves a conjecture of Häggkvist [8] in the special case of arrays with even side.

Ämnesord

NATURVETENSKAP  -- Matematik -- Diskret matematik (hsv//swe)

NATURAL SCIENCES  -- Mathematics -- Discrete Mathematics (hsv//eng)

Nyckelord

Latin square

avoidability

avoidable array

Discrete mathematics

Diskret matematik

Mathematics

matematik

Publikations- och innehållstyp

vet (ämneskategori)

ovr (ämneskategori)