2016/05/04 by Pascal Schweitzer, Schweitzer, Pascal, Patrick Schweitzer +1
Mathematics · #05C75 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C75
paper · pdf · doi:10.48550/arxiv.1605.01320
11 pages, 3 figures
arxiv created 2016/05/04 · arxiv updated 2016/05/05
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.