We prove that for any circle graph with at least one edge and for any positive integer , there exists an integer so that every graph either has a vertex-minor isomorphic to the disjoint union of copies of , or has a -perturbation with no vertex-minor isomorphic to . Using the …