{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T21:35:25Z","timestamp":1778794525121,"version":"3.51.4"},"reference-count":17,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4485,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1994,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Pick a tree uniformly at random from among all unlabeled trees on <jats:italic>n<\/jats:italic> vertices, and let X<jats:sub><jats:italic>n<\/jats:italic><\/jats:sub> be the maximum of the degrees of its vertices. For any fixed integer <jats:italic>d<\/jats:italic>,\n<jats:chem-struct-wrap><jats:chem-struct><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mimetype=\"image\/gif\" position=\"anchor\" specific-use=\"enlarged-web-image\" xlink:href=\"graphic\/must001.gif\"><jats:alt-text>magnified image<\/jats:alt-text><\/jats:graphic><\/jats:chem-struct><\/jats:chem-struct-wrap>\nas <jats:italic>n<\/jats:italic>\u2192\u221e, where \u03bc<jats:sub>n<\/jats:sub> = <jats:italic>c<\/jats:italic><jats:sub>1<\/jats:sub> log <jats:italic>n<\/jats:italic>, where {\u03bc<jats:sub>n<\/jats:sub>} : = \u03bc<jats:sub>n<\/jats:sub> \u2013 \u230a\u03bc\u230b denotes the fractional part of \u03bc<jats:sub>n<\/jats:sub> and where <jats:italic>c<\/jats:italic><jats:sub><jats:italic>o<\/jats:italic><\/jats:sub>, <jats:italic>c<\/jats:italic><jats:sub>1<\/jats:sub>, and \u03b7<jats:sub>\u221e<\/jats:sub> are knnown constants, givenb approximately by <jats:italic>c<\/jats:italic><jats:sub><jats:italic>0<\/jats:italic><\/jats:sub> = 3.262 \u2026, <jats:italic>c<\/jats:italic><jats:sub>1<\/jats:sub> = 0.9227 \u2026, and \u03b7<jats:sub>\u221e<\/jats:sub> = 0.3383\u2026. \u00a9 1994 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/rsa.3240050304","type":"journal-article","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T20:17:44Z","timestamp":1180729064000},"page":"411-440","source":"Crossref","is-referenced-by-count":6,"title":["Unlabeled trees: Distribution of the maximum degree"],"prefix":"10.1002","volume":"5","author":[{"given":"William M. Y.","family":"Goh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Schmutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(84)90055-4"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90004-6"},{"key":"e_1_2_1_4_2","volume-title":"Graphical Enumeration","author":"Harary F.","year":"1973"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700016190"},{"key":"e_1_2_1_6_2","unstructured":"A.MeirandJ. W.Moon On nodes of large out\u2010degree in random trees to appear."},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"A.MeirandJ. W.Moon On the altitude of nodes in a random tree Can. J. Math. (5) 997\u20131015(1978).","DOI":"10.4153\/CJM-1978-085-0"},{"key":"e_1_2_1_8_2","first-page":"77","volume":"51","author":"Meir A.","year":"1989","journal-title":"On an asymptotic method in enumeration, J.C.T. Ser A"},{"key":"e_1_2_1_9_2","first-page":"147","article-title":"On the maximum out\u2010degree in a random tree","volume":"2","author":"Meir A.","year":"1990","journal-title":"Austr. J. Combinat."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1029000098"},{"key":"e_1_2_1_11_2","article-title":"Counting labeled trees","volume":"1","author":"Moon J. W.","year":"1970","journal-title":"Can. Math. Monogr."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(82)90005-6"},{"key":"e_1_2_1_13_2","volume-title":"Handbook of Combinatorics","author":"Odlyzko A. M.","year":"1993"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.2307\/1969046"},{"key":"e_1_2_1_15_2","first-page":"227","article-title":"Unsolved problems in the theory of random graphs","volume":"33","author":"Palmer E. M.","year":"1987","journal-title":"Ann. Discr. Math."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4664-0"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90076-X"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90008-5"}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240050304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240050304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T03:37:26Z","timestamp":1698205046000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240050304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["10.1002\/rsa.3240050304"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240050304","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}