Minimal asymmetric graphs

Confirming a conjecture of Nešetřil, we show that up to isomorphism there are only finitely many finite minimal asymmetric undirected graphs. In fact, there are exactly 18 such graphs. We also show that these graphs are exactly the finite minimal involution-free graphs.