Journal of Statistical Physics, Vol. 109, Nos. 5/6, December 2002. p. 923-943.
We give upper and lower bounds on the number of graphs of fixed degree which have a positive density of triangles. In particular, we show that there are very few such graphs, when compared to the number of graphs without this restriction. We also show that in this case the triangles seem to cluster even at low density.