@article{9589,
  abstract     = {We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence , provided that the number of edges is at least , where  is the maximum degree. A key part of our argument involves establishing a concentration result for a certain family of functions over random trees with given degrees, using Prüfer codes.},
  author       = {Greenhill, Catherine and Isaev, Mikhail and Kwan, Matthew Alan and McKay, Brendan D.},
  issn         = {0195-6698},
  journal      = {European Journal of Combinatorics},
  pages        = {6--25},
  publisher    = {Elsevier},
  title        = {{The average number of spanning trees in sparse graphs with given degrees}},
  doi          = {10.1016/j.ejc.2017.02.003},
  volume       = {63},
  year         = {2017},
}