{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T04:45:11Z","timestamp":1692593111408},"reference-count":13,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T00:00:00Z","timestamp":1661558400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[2023,5]]},"abstract":"Abstract<\/jats:title>For a graph , let be the number of spanning trees of with maximum degree at most . For , it is proved that every connected \u2010vertex \u2010regular graph with satisfies \nwhere approaches 1 extremely fast (e.g., ). The minimum degree requirement is essentially tight as for every there are connected \u2010vertex \u2010regular graphs with for which . Regularity may be relaxed, replacing with the geometric mean of the degree sequence and replacing with that also approaches 1, as long as the maximum degree is at most . The same holds with no restriction on the maximum degree as long as the minimum degree is at least .<\/jats:p>","DOI":"10.1002\/rsa.21118","type":"journal-article","created":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T10:00:25Z","timestamp":1661594425000},"page":"737-757","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The number of bounded\u2010degree spanning trees"],"prefix":"10.1002","volume":"62","author":[{"given":"Raphael","family":"Yuster","sequence":"first","affiliation":[{"name":"Department of Mathematics University of Haifa Haifa Israel"}]}],"member":"311","published-online":{"date-parts":[[2022,8,27]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010204"},{"key":"e_1_2_7_3_1","volume-title":"The probabilistic method","author":"Alon N.","year":"2004"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.08.005"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-009-2360-2"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.37236\/1577"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2016.06.001"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2017.02.003"},{"key":"e_1_2_7_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90182-3"},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060214"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(83)80045-6"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00582-4"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02995957"}],"container-title":["Random Structures & Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.21118","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/rsa.21118","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.21118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T02:09:42Z","timestamp":1692583782000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.21118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,27]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["10.1002\/rsa.21118"],"URL":"https:\/\/doi.org\/10.1002\/rsa.21118","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,27]]},"assertion":[{"value":"2022-02-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-06-28","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}