Isoperimetry in Product Graphs

Abstract

In this short note, we establish an edge-isoperimetric inequality for arbitrary product graphs. Our inequality is sharp for subsets of many different sizes in every product graph. In particular, it implies that the $2^d$-element sets with smallest edge-boundary in the hypercube are subcubes and is only marginally weaker than the Bollobás-Leader edge-isoperimetric inequalities for grids and tori. Additionally, it improves two edge-isoperimetric inequalities for products of regular graphs proved by Erde, Kang, Krivelevich, and the first author and answers two questions about edge-isoperimetry in powers of regular graphs raised in their work.