The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those points it contains. We derive upper and lower bounds on the isoperimetric numbers of such graphs, with particular attention to the special cases of finite projective planes and Hadamard designs.
