Advanced Search

Let T be a hamiltonian tournament with n vertices and γ a hamiltonian cycle of T. In previous works we introduced and studied the concept of cycle-pancyclism to capture the following question: What is the maximum intersection with γ of a cycle of length k? More precisely, for a cycle Cₖ of length k in T we denote $I_{\gamma }\left(Cₖ\right)=\left|A\left(\gamma \right)\cap A\left(Cₖ\right)\right|$, the number of arcs that γ and Cₖ have in common. Let $f(k,T,\gamma )=max{I}_{\gamma }\left(Cₖ\right)|Cₖ\subset T$ and f(n,k) = minf(k,T,γ)|T is a hamiltonian tournament with n vertices, and γ a hamiltonian cycle of T. In previous papers we gave...