I am interested in coverings of complete graph $K_n$ by cycles of length $4$. It is clear that covering always exist when $n \ge 3$. I need to find minimal number of $4$-cycles to cover $K_n$.
For example $K_5$ can be covered by following cycles $(1, 2, 3, 5), (2, 5, 4, 3), (2, 4, 1, 3)$.
I am...0
Well, I was contemplating while reading a book on nonlinear dynamics.
For example we have: $x_{n+1}=f(x_n)$ for some sequence $x_n$, and $f$ is some function.
Then obviously we can check for the iteration of $f$.
I was thinking, is there any meaning for equating between the $m$-th iteration of...
Let k be a field, and L/k a finitely generated field extensions. I would like to know if one can classify intermediate extensions L/K/k such that K/k has transcendence degree one.
This question comes from geometry, where given a birational class of a variety X over k (with function field L), on...
