On the completability of incomplete orthogonal Latin rectangles

DOI10.1016/j.disc.2016.02.008zbMath1333.05043MaRDI QIDQ267209

F. Blanchet-Sadri, M. Dambrine

Publication date: 8 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.02.008

zbMATH Keywords

orthogonality; circuit; polyhedral combinatorics; 2-row Latin rectangle; completability; lifted circuit inequality

Mathematics Subject Classification ID

05B15: Orthogonal arrays, Latin squares, Room squares

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)