The minimum edge-pancyclic graph of a given order

A graph $G$ of order $n$ is called edge-pancyclic if, for every integer $k$ with $3 \leq k \leq n$, every edge of $G$ lies in a cycle of length $k$. Determining the minimum size $f(n)$ of a simple edge-pancyclic graph with $n$ vertices seems difficult. Recently, Li, Liu and Zhan \cite{li2024minimum} gave both a lower bound and an upper bound of $f(n)$. In this paper, we improve their lower bound by considering a new class of graphs and improve the upper bound by constructing a family of edge-pancyclic graphs.