Subgraphs of dense random graphs with specified degrees

W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc

1963

Earlier work this paper cites.

B. D. McKay, Spanning trees in random regular graphs, Third Caribbean Conference on Combinatorics and Computing

1981

Earlier work this paper cites.

B. D. McKay, Subgraphs of random graphs with specified degrees, Congr. Numer

1981

Earlier work this paper cites.

B. D. McKay, Asymptotics for symmetric 0-1 matrices with prescribed row sums, Ars Combin

1985

Earlier work this paper cites.

B. Bollobás and B. D. McKay, The number of matchings in random regular graphs and bipartite graphs, J. Combin. Th. Ser. B

1986

Earlier work this paper cites.

B. D. McKay, The asymptotic numbers of regular tournaments, eulerian digraphs and eulerian oriented graphs, Combinatorica

1990

Earlier work this paper cites.

B. D. McKay and N. C. Wormald, Asymptotic enumeration by degree sequence of graphs of high degree, European J. Combin

1990

Earlier work this paper cites.

B. D. McKay and N. C. Wormald, Asymptotic enumeration by degree sequence of graphs with degrees o ⁡ ( n 1 / 2 ) o(n^{1/2}) , Combinatorica

1991

Cited alongside, same era.

B. D. McKay and X. Wang, Asymptotic enumeration of tournaments with a given score sequence, J. Combin. Theory Ser. A

1996

Cited alongside, same era.

B. D. McKay and R. W. Robinson, Asymptotic enumeration of Eulerian circuits in the complete graph, Combin. Prob. Comput

1998

Cited alongside, same era.

N. C. Wormald, Models of random regular graphs, in Surveys in Combinatorics, 1999

1999

Cited alongside, same era.

M. Krivelevich, B. Sudakov, V. Vu and N. C. Wormald, Random regular graphs of high degree, Europ. J. Combin

2001

Cited alongside, same era.

P. Boldi and S. Vigna, Lower bounds for sense of direction in regular graphs, Distrib. Comput

2003

Later among the works it cites.

C. Greenhill, B. D. McKay and X. Wang, Asymptotic enumeration of sparse irregular bipartite graphs, J. Combin. Th. Ser. A

2006

Later among the works it cites.

E. R. Canfield, C. Greenhill and B. D. McKay, Asymptotic enumeration of dense 0-1 matrices with specified line sums, J. Combin. Th. Ser. A

2008

Later among the works it cites.

C. Greenhill and B. D. McKay, Random dense bipartite graphs and directed graphs with specified degrees, Random Struct. Alg

2009

Later among the works it cites.

A. Barvinok and J. A. Hartigan, The number of graphs and a random graph with a given degree sequence, preprint (2010). Available at arxiv.org/abs/1003.0356

Original

2010

Closest in time.