Dense Expanders and Pseudo-Random Bipartite Graphs

Citations of this article
Mendeley users who have this article in their library.


This chapter points out how checking a very simple condition often suffices to show that a dense bipartite graph is a good expander. The check is much easier to apply than the eigenvalue method, though in the cases where both methods are feasible both will give much the same results. The sufficient condition offered in the chapter is derived from a study of pseudo-random graphs. The check involves merely the degrees of vertices and the number of common neighbors of pairs of vertices. In fact it is sufficient to imply the bipartite graph is “pseudo-random.”. © 1989, Elsevier Inc.




Thomason, A. (1989). Dense Expanders and Pseudo-Random Bipartite Graphs. Annals of Discrete Mathematics, 43(C), 381–386.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free