Hamilton cycles in circuit graphs of matroids

In the circuit graph of a matroid the vertices are the circuits and the edges are the pairs CC′CC′ such that CC and C′C′ have nonempty intersection. It is proved that the circuit graph of a connected matroid with at least four circuits is uniformly Hamilton.