Is there any result about the time complexity of finding a cycle of fixed length k in a general graph?
All I know is that Noga Alon et al. use the techinique called "color-coding",
which has a running time O(M(n)), where M(n) is the time of multiplying two n times n
matrices.

Is there any better result?