Lower Bounds for Leaf Rank of Leaf Powers
<|reference_start|>Lower Bounds for Leaf Rank of Leaf Powers: Leaf powers and $k$-leaf powers have been studied for over 20 years, but there are still several aspects of this graph class that are poorly understood. One such aspect is the leaf rank of leaf powers, i.e. the smallest number $k$ such that a graph $G$ is a $k$-leaf power. Computing the leaf rank of leaf powers has proved a hard task, and furthermore, results about the asymptotic growth of the leaf rank as a function of the number of vertices in the graph have been few and far between. We present an infinite family of rooted directed path graphs that are leaf powers, and prove that they have leaf rank exponential in the number of vertices (utilizing a type of subtree model first presented by Rautenbach [Some remarks about leaf roots. Discrete mathematics, 2006]). This answers an open question by Brandst\"adt et al. [Rooted directed path graphs are leaf powers. Discrete mathematics, 2010].<|reference_end|>
@article{høgemo2024lower,
    title={Lower Bounds for Leaf Rank of Leaf Powers},
    author={Svein H{o}gemo},
    journal={arXiv preprint arXiv:2402.18245},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.18245},
    primaryClass={cs.DM cs.DS math.CO}
}