Avoiding Arrays of Odd Order by Latin Squares

DOI10.1017/S0963548312000570zbMath1260.05020OpenAlexW2132707855MaRDI QIDQ4911169

Carl Johan Casselgren, Lars-Daniel Öhman, Lina J. Andrén

Publication date: 14 March 2013

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548312000570

zbMATH Keywords

Latin squaresavoidable arrays

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Avoiding and extending partial edge colorings of hypercubes ⋮ Coloring complete and complete bipartite graphs from random lists ⋮ Restricted extension of sparse partial edge colorings of complete graphs ⋮ On restricted colorings of (d, s)-edge colorable graphs ⋮ Threshold for Steiner triple systems ⋮ Restricted extension of sparse partial edge colorings of hypercubes ⋮ Latin cubes with forbidden entries ⋮ Latin cubes of even order with forbidden entries ⋮ On the threshold problem for Latin boxes ⋮ Restricted completion of sparse partial Latin squares

Cites Work

• Partial Latin squares are avoidable
• On avoiding some families of arrays
• A note on Latin squares with restricted support
• Avoiding partial Latin squares and intricacy
• Avoiding multiple entry arrays
• Unnamed Item

This page was built for publication: Avoiding Arrays of Odd Order by Latin Squares