Further Results on the Maximum Number of Stars in Graphs with Forbidden Properties

Yuxuan Liu, Jia-Bao Yang, Leilei Zhang

A graph $G$ is called $k$-edge-hamiltonian if every linear forest (i.e., a disjoint union of paths) with at most $k$ edges is contained in a Hamilton cycle of $G$. In 2018, Füredi…