The paper brings a nonconstructive proof of the fact that, for every \(k\geq 3\) and \(g\in \{5,7\}\), there exists a \(k\)-regular graph of girth \(g\), containing also a cycle of length \(g+1\). This results is also generalized for higher odd \(g\).