Classes of graphs with strongly sublinear separators (i.e., separators of order at most \(n^{1-\epsilon}\) for some \(\epsilon>0)\) have important algorithmic and structural properties. We explore some of these properties, especially in relation to polynomial expansion and tree-width fragility.