MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

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).