Homomorphisms of Trees into a Path
DownloadCsikvari-2015-Homomorphisms of trees.pdf (355.4Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
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[subscript m],P[subscript n]) ≤ hom(T[subscript m],P[subscript n]) ≤ hom(S[subscript m],P[subscript n]), where T[subscript m] is any tree on m vertices, and P[subscript m] and S[subscript 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.
Date issued
2015-08Department
Massachusetts Institute of Technology. Department of MathematicsJournal
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial and Applied Mathematics
Citation
Csikvari, Peter, and Zhicong Lin. “Homomorphisms of Trees into a Path.” SIAM Journal on Discrete Mathematics 29, no. 3 (January 2015): 1406–1422. © 2015, Society for Industrial and Applied Mathematics
Version: Final published version
ISSN
0895-4801
1095-7146