In 3-D Euclidean geometry, if you have a star close to* each of the vertexes of a cube, and one at the centre of the cube, then all the other stars attack the one in the centre, and the one in the centre attacks one of the others. That gives 7 unattacked.
There may be a way to get 8 unattacked. I think it would involve having 8 on the surface of a sphere, and (using latitude & longitude) having 3 on the equator at 0, -120 and +120 degrees, then 3 each on circles in the northern and southern hemispheres at -60, +60 and 180 degrees. I don’t know enough spherical trigonometry to know if you could do that so that each is more than 60 degrees from the other, so that the centre point is closer.
*It has to be close to, rather than at, so that all the distances are different.
Doesn’t this violate the no-equidistant-pairs restriction? Is there enough leeway for offsets to avoid it? Interesting extrapolation, regardless–I was only playing with the original 7-system scenario.
I’ll admit I worded my post very poorly. I don’t think that every even-numbered system will break down into pairs. I just figured it was possible so an even-numbered solution is possible.
But an odd-numbered solution is not. As I wrote, an odd-numbered system would require at least one group of three stars where A is closer to B than C, B is closer to C than A, and C is closer to A than B. And such a triangle cannot be constructed. For such a triangle to exist AB<BC, BC<CA, and CA<AB. But if AB is smaller than BC and BC is smaller than CA, then AB must be smaller than CA.