  We investigate lettericity in graphs, in particular the question of the
greatest lettericity of a graph on $n$ vertices. We show that all graphs on $n$
vertices have lettericity at most $n-(1/2)\log_2 n$ and that almost all graphs
on $n$ vertices have lettericity at least $n-(2\log_2 n + 2\log_2\log_2 n)$.
