Synchronizing random automata on $4$-letter alphabet

The paper deals with the synchronization of a random automaton that is sampled uniformly at random from the set of all automata with $n$ states and $m$ letters. We show that for $m=4$ the probability that a random automaton is synchronizing is larger than a positive constant.