On the completability of incomplete orthogonal Latin rectangles

DOI10.1016/j.disc.2016.02.008zbMath1333.05043OpenAlexW2295710975MaRDI 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

orthogonalitycircuitpolyhedral combinatorics2-row Latin rectanglecompletabilitylifted circuit inequality

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of completing partial Latin squares
• On the completability of incomplete Latin squares
• The many formulae for the number of Latin rectangles
• On the generation of circuits and minimal forbidden sets
• On multi-index assignment polytopes
• On the number of Latin squares
• When is an incomplete 3× n latin rectangle completable?
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Counting Latin rectangles
• On the facial structure of set packing polyhedra
• An existence theorem for latin squares

This page was built for publication: On the completability of incomplete orthogonal Latin rectangles