A note on the minimum size of a vertex pancyclic graph (Q1356690)

A graph \(G\) is pancyclic if every vertex of \(G\) is contained in a cycle of length \(k\) for \(3\leq k\leq n\) (\(n\) is the order of \(G\)). Let \(m_n\) denote the minimum number of edges in a vertex pancyclic graph of order \(n\). It is shown that \(m_3=3\), \(m_4=7\), \(m_6=9\), and \(\frac{3}{2}n< m_n\leq\lfloor \frac{5}{3}n\rfloor\) for \(n\geq 7\). It would be interesting to find the value of \(m_n\) for \(n\geq 7\) or to find the minimum constant \(c\) such that \(m_n\geq cn\).