Transit sets of k-point crossover operators

Abstract k -point crossover operators and their recombination sets are studied from different perspectives. We show that transit functions of k -point crossover generate, for all k > 1 , the same convexity as the interval function of the underlying graph. This settles in the negative an open problem by Mulder about whether the geodesic convexity of a connected graph G is uniquely determined by its interval function I . The conjecture of Gitchoff and Wagner that for each transit set R k ( x , y ) distinct from a hypercube there is a unique pair of parents from which it is generated is settled affirmatively. Along the way we characterize transit functions whose underlying graphs are Hamming graphs, and those with underlying partial cube graphs. For general values of k it is shown that the transit sets of k -point crossover operators are the subsets with maximal Vapnik–Chervonenkis dimension.