  An internal partition of a graph is a partitioning of the vertex set into two
parts such that for every vertex, at least half of its neighbors are on its
side. We prove that for every positive integer $r$, asymptotically almost every
$2r$-regular graph has an internal partition.
