|
|
|
|
| LEADER |
01257 am a22001813u 4500 |
| 001 |
100547 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Csikvari, Peter
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Mathematics
|e contributor
|
| 100 |
1 |
0 |
|a Csikvari, Peter
|e contributor
|
| 700 |
1 |
0 |
|a Lin, Zhicong
|e author
|
| 245 |
0 |
0 |
|a Homomorphisms of Trees into a Path
|
| 260 |
|
|
|b Society for Industrial and Applied Mathematics,
|c 2015-12-28T23:48:23Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/100547
|
| 520 |
|
|
|a 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.
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t SIAM Journal on Discrete Mathematics
|
