Is there a de Bruijn–Erdős theorem for words? – mathoverflow.net
martin
Given an alphabet of $p$ letters, how can I find a minimal set $F$ of words of length at most $p$ such that every two-letters word appears as a subsequence (subword) in exactly one of the words in ...