TY - JOUR AB - 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. AU - Greenhill, Catherine AU - Isaev, Mikhail AU - Kwan, Matthew Alan AU - McKay, Brendan D. ID - 9589 JF - European Journal of Combinatorics SN - 0195-6698 TI - The average number of spanning trees in sparse graphs with given degrees VL - 63 ER -