  We show that Geometric Inhomogeneous Random Graphs (GIRGs) with power law
weights may either have or not have separators of linear size, depending on the
underlying geometry. While it was known that for Euclidean geometry it is
possible to split the giant component into two linear size components by
removing at most n^{1-\eps} edges, we show that this is impossible if the
geometry is given by the minimum component distance.
