We prove a converse to Myhill's “Garden-of-Eden” theorem and obtain in this manner a
characterization of amenability in terms of cellular automata: A group G is amenable if and
only if every cellular automaton with carrier G that has gardens of Eden also has mutually
erasable patterns.