Theorem For any positive integer n > 6 there exists a Monogamous Latin Square of order n, except possibly when n = 2p for some prime p > 11.
In this paper, we study covering arrays avoiding forbidden edges (CAFE's), where certain pairwise interactions are forbidden while all others must be covered, and we aim to minimize the number of tests. We establish a theoretical framework for this problem, by providing connections to the edge clique covering problem, lower and upper bounds, complexity results and a recursive construction. We also give an algorithm for the case of binary alphabets.
Maintained by Peter Danziger, September 2009.