Home » Subject » Graph Theory » Extremal G.T.
Importance: Medium ✭✭
Author(s): Zhicong Lin
Subject: Graph Theory
» Extremal Graph Theory
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.
3 comments

Reply

Comments are limited to a maximum of 1000 characters.
More information about formatting options