Small separations in vertex-transitive graphs

From MaRDI portal



Abstract: Let k be an integer. We prove a rough structure theorem for separations of order at most k in finite and infinite vertex transitive graphs. Let G=(V,E) be a vertex transitive graph, let AsubseteqV be a finite vertex-set with |A|le|V|/2 and u sim vforsomeu in A. We show that whenever the diameter of G is at least 31(k+1)2, either |A|le2k3+k2, or G has a ring-like structure (with bounded parameters), and A is efficiently contained in an interval. This theorem may be viewed as a rough characterization, generalizing an earlier result of Tindell, and has applications to the study of product sets and expansion in groups.












This page was built for publication: Small separations in vertex-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439431)