Homomorphisms of Trees into a Path
Name
Csikvari-2015-Homomorphisms of trees.pdf
Size
355.48 KB
Format
Adobe PDF
Checksum (MD5)
26da8afc34c04fcaffdeeb93d5210181
Author(s)
Csikvari, Peter
Lin, Zhicong
Date Issued
August 2015
Journal
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
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/140993995
