On linking of hamiltonian pairs of cycles in spatial graphs

A pair of disjoint cycles in a graph is said to be hamiltonian if the union of cycles covers all vertices of the graph. It is shown that for each $n\ge7$ for any spatial embedding of the complete graph $K_n$ there is a hamiltonian pair that forms a nontrivial two-component link.