  An intuitive property of a random graph is that its subgraphs should also
appear randomly distributed. We consider graphs whose subgraph densities
exactly match their expected values. We call graphs with this property for all
subgraphs with $k$ vertices to be $k$-symmetric. We discuss some properties and
examples of such graphs. We construct 3-symmetric graphs and provide some
statistics.
