Avoidability by Latin squares of arrays of even order
(English)Manuscript (preprint) (Other academic)
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  in the special case of arrays with even side.
Latin square, avoidability, avoidable array
Research subject Mathematics
IdentifiersURN: urn:nbn:se:umu:diva-36025OAI: oai:DiVA.org:umu-36025DiVA: diva2:351489