This reminded me of how cool the Petersen graph is; a 6-post 🧵.
First, what is it? The vertices are labeled by the 2-element subsets of {1,...,5}, and there is an edge between two vertices if the subsets are disjoint.
This gives S5 in its automorphism group; in fact that's all there is.
#MathSky
Joshua Grochow
The Petersen Graph (automorphism group: S5) showing symmetries of order 5 and 3.
#GraphAutomorphisms #GraphTheory
