Consider a network of identical phase oscillators with sinusoidal coupling. How likely is the network to synchronize, starting from a random initial condition? One expects that very dense networks have a strong tendency to synchronize and the basin of attraction for the synchronous state to be the whole phase space. In this talk, we use techniques from numerical linear algebra and computational algebraic geometry to derive the densest known networks that do not synchronize and the sparsest networks that do.