Zhicong Lin

Extremal problem on the number of tree endomorphism ★★

Author(s): Zhicong Lin

\begin{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. \end{conjecture}


Syndicate content