Minimal Asymmetric Graphs
Combinatorics
2016-05-05 v1
Abstract
Confirming a conjecture of Ne\v{s}et\v{r}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.
Keywords
Cite
@article{arxiv.1605.01320,
title = {Minimal Asymmetric Graphs},
author = {Pascal Schweitzer and Patrick Schweitzer},
journal= {arXiv preprint arXiv:1605.01320},
year = {2016}
}
Comments
11 pages, 3 figures