One of my current favourites can be found on Peter Cameron's blog. Take a countable model $(M,E)$ of enough (axioms of) set theory. Symmetrize the relation $E$ to obtain a graph. This graph is the random graph (Rado's homogeneous universal countable graph).
|
1 | [made Community Wiki] | ||
|
|
||||
