The Minimal Automorphism-Free Tree

MaRDI QIDQ6240131zbMATH OpenFDO

Authors Ilhee Kim, Ringi Kim, Paul Seymour

Publication date 6 March 2013

Abstract: A finite tree $T$ with $|V(T)|geq2$ is called {it automorphism-free} if there is no non-trivial automorphism of $T$. Let $mathcalAFT$ be the poset with the element set of all finite automorphism-free trees (up to graph isomorphism) ordered by $T_{1}preceq{T}_2$ if $T_1$ can be obtained from $T_2$ by successively deleting one leaf at a time in such a way that each intermediate tree is also automorphism-free. In this paper, we prove that $mathcalAFT$ has a unique minimal element. This result gives an affirmative answer to the question asked by Rupinski.

This page was built for publication: The Minimal Automorphism-Free Tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6240131)