E. A. Bender, Asymptotic Methods in Enumeration, SIAM Review, vol.16, issue.4, pp.485-515, 1974.
DOI : 10.1137/1016082

E. A. Bender and E. R. Canfield, The asymptotic number of labeled graphs with given degree sequences, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.296-307, 1978.
DOI : 10.1016/0097-3165(78)90059-6

B. Bollobás, A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs, European Journal of Combinatorics, vol.1, issue.4, pp.311-316, 1980.
DOI : 10.1016/S0195-6698(80)80030-8

K. J. Compton, A logical approach to asymptotic combinatorics I. First order properties, Advances in Mathematics, vol.65, issue.1, pp.65-96, 1987.
DOI : 10.1016/0001-8708(87)90019-3

H. Ebbinghaus and J. Flum, Finite Model Theory, 1999.

S. Haber and M. Krivelevich, The logic of random regular graphs, Journal of Combinatorics, vol.1, issue.4, pp.389-440, 2010.
DOI : 10.4310/JOC.2010.v1.n4.a3

C. Hundack, H. J. Prömel, and A. Steger, Extremal Graph Problems for Graphs with a Color-Critical Vertex, Combinatorics, Probability and Computing, vol.1, issue.04, pp.465-477, 1993.
DOI : 10.1002/rsa.3240030404

J. W. Kennedy and L. V. Quintas, Probability Models for Random f-Graphs, Combinatorial Mathematics: Proceedings of the Third International Conference, pp.248-261, 1989.
DOI : 10.1016/0196-6774(84)90030-0

V. Koponen, A limit law of almost l-partite graphs, submitted. Available via

L. Libkin, Elements of Finite Model Theory, 2004.
DOI : 10.1007/978-3-662-07003-1

J. F. Lynch, Convergence law for random graphs with specified degree sequence, ACM Transactions on Computational Logic, vol.6, issue.4, pp.727-748, 2005.
DOI : 10.1145/1094622.1094627

B. D. Mckay and N. C. Wormald, Automorphisms of random graphs with specified vertices, Combinatorica, vol.31, issue.4, pp.325-338, 1984.
DOI : 10.1007/BF02579144

A. Rucinski and N. C. Wormald, Random Graph Processes with Degree Restrictions, Combinatorics, Probability and Computing, vol.41, issue.02, pp.169-180, 1992.
DOI : 10.1016/0196-6774(90)90029-E

A. Rucinski and N. C. Wormald, Random graph processes with maximum degree 2, The Annals of Probability, pp.183-199, 1997.

J. Spencer, The strange logic of random graphs, 2001.
DOI : 10.1007/978-3-662-04538-1

N. C. Wormald, The asymptotic connectivity of labelled regular graphs, Journal of Combinatorial Theory, Series B, vol.31, issue.2, pp.156-167, 1981.
DOI : 10.1016/S0095-8956(81)80021-4

N. C. Wormald, The asymptotic distribution of short cycles in random regular graphs, Journal of Combinatorial Theory, Series B, vol.31, issue.2, pp.168-182, 1981.
DOI : 10.1016/S0095-8956(81)80022-6

N. C. Wormald, Models of Random Regular Graphs, Surveys in Combinatorics, pp.239-298, 1999.
DOI : 10.1017/CBO9780511721335.010