INFO:

The minimal degree of a permutation group G is the minimum number of points not fixed by non-identity elements of G. Lower bounds on the minimal degree have strong structural consequences on G. In 2014 Babai proved that the automorphism group of a strongly regular graph with n vertices has minimal degree at least cn, with known exceptions. Strongly regular graphs correspond to primitive coherent configurations of rank 3. We extend Babai