Extremal problem on the number of tree endomorphism

Importance: Medium ✭✭
Author(s): Zhicong Lin
Keywords:
Recomm. for undergrads: yes
Posted by: shudeshijie
on: March 1st, 2011
Conjecture   An endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges. Among all the $ n $ vertices' trees, the star with $ n $ vertices has the most endomorphisms, while the path with $ n $ vertices has the least endomorphisms.

Bibliography

[BT] Bela Bollobas and Mykhaylo Tyomkyn, Walks and paths in trees, http://arxiv.org/abs/1002.2768.


* indicates original appearance(s) of problem.

the upper bound is proved

the upper bound is proved recently.

counterexample

Asymmetric tree (http://en.wikipedia.org/wiki/Asymmetric_graph, http://upload.wikimedia.org/wikipedia/commons/a/ad/Asymmetric_tree.svg) has single, trivial endomorphism.

Update: Sorry, I have confused endomorphism with automorphism.

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.