Minimal Asymmetric Graphs

Abstract

Confirming a conjecture of Nešetřil, we show that up to isomorphism there is only a finite number of 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.

11 pages, 3 figures