Minimal Asymmetric Graphs
classification
🧮 math.CO
keywords
graphsfiniteminimalasymmetricexactlythereconfirmingconjecture
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.