Forbiddance and Capacity

We show that the maximum number of ternary sequences of length n such that no two of them feature all the three symbol pairs in their coordinates is 2 (n+o(n)). In fact, we present a far more general theorem about problems of a similar nature. We explore the connections of our results to those on zero-error capacity of graph families. © 2010 Springer