{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T04:51:26Z","timestamp":1791521486069,"version":"4.3.4"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>Let ${{hom}}(G,H)$ denote the number of homomorphisms from a graph $G$ to a graph $H$. In this paper we study the number of homomorphisms of trees into a path, and prove that ${{hom}}(P_m,P_n)\\leq {{hom}}(T_m,P_n)\\leq {{hom}}(S_m,P_n),$ where $T_m$ is any tree on $m$ vertices, and $P_m$ and $S_m$ denote the path and star on $m$ vertices, respectively. This completes the study of extremal problems concerning the number of homomorphisms between trees started in the paper Graph Homomorphisms Between Trees [Electron. J. Combin., 21 (2014), 4.9] written by the authors of the current paper.<\/jats:p>","DOI":"10.1137\/140993995","type":"journal-article","created":{"date-parts":[[2015,8,6]],"date-time":"2015-08-06T15:09:19Z","timestamp":1438873759000},"page":"1406-1422","source":"Crossref","is-referenced-by-count":3,"title":["Homomorphisms of Trees into a Path"],"prefix":"10.1137","volume":"29","author":[{"given":"P\u00e9ter","family":"Csikv\u00e1ri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhicong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,8,6]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"B. Bolloba\u0301s,\n                      Modern Graph Theory\n                      , Grad. Texts in Math. 184, Springer-Verlag, New York, 1998.","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20600"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"J.A. Bondy and U.S.R. Murty,\n                      Graph Theory\n                      , Springer-Verlag, New York, 2008.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"atypb4","first-page":"315","author":"Borgs C.","year":"2006","journal-title":"Berlin"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-010-2516-0"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21693"},{"key":"atypb7","doi-asserted-by":"crossref","first-page":"4","DOI":"10.37236\/4096","volume":"21","author":"Csikva\u0301ri P.","year":"2014","journal-title":"Electron. J. Combin."},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20530"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21749"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.12.004"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90388-3"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"R.P. Stanley,\n                      Enumerative Combinatorics\n                      , Vol. 1, 2nd ed., Cambridge University Press, Cambridge, 2011.","DOI":"10.1017\/CBO9781139058520"},{"key":"atypb13","first-page":"497","author":"Wachs M.L.","year":"2007","journal-title":"RI"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140993995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:17:52Z","timestamp":1787318272000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140993995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/140993995"],"URL":"https:\/\/doi.org\/10.1137\/140993995","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}