Context: Many resources, like
state the theorem in the general case, but then prove it only for the bipartite case. The full case is supposedly proved in Pinsker's 1973 paper. However, I can't dig up a copy.
Anyone know of a proof for the general case (i.e. d-regular, undirected, not-necessarily-bipartitite graph)?