J. A. Hartigan

Learn More
We consider the set of all graphs on n labeled vertices with prescribed degrees D = (d 1 ,. .. , d n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within a relative error which approaches 0 as n grows. As a corollary, we prove that the structure of a random graph with(More)
  • 1