Zhicong Lin

Extremal problem on the number of tree endomorphism ★★

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.

Keywords:

Posted by shudeshijie
updated November 25th, 2020

3 comments

Open Problem Garden

Zhicong Lin

Extremal problem on the number of tree endomorphism ★★

Navigate

Recent Activity