TITLE: How to prove a random d-regular graph is an expander with prob >= 0.5?
QUESTION [7 upvotes]: Context: Many resources, like
http://math.mit.edu/~fox/MAT307-lecture22.pdf
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)?
Thanks!

REPLY [3 votes]: Pinsker's original paper is now available online in the archive of the International Teletraffic Congress:
http://ww.i-teletraffic.org/fileadmin/ITCBibDatabase/1973/pinsker731.pdf