Subsets of Cayley Graphs That Induce Many Edges

William Gowers, Oliver Janzer, Apollo-University Of Cambridge Repository, Apollo-University Of Cambridge Repository
Let G be a regular graph of degree d and let A ⊂ V (G). Say that A is η-closed if the average degree of the subgraph induced by A is at least ηd. This says that if we choose a random vertex x ∈ A and a random neighbour y of x, then the probability that y ∈ A is at least η. This paper was motivated by an attempt to obtain a qualitative description of closed subsets of the Cayley graph Γ whose vertex set is F n 1 2 ⊗ · · · ⊗ F n d 2 with two vertices joined by an edge if their difference is of
more » ... difference is of the form u 1 ⊗ · · · ⊗ u d . For the matrix case (that is, when d = 2), such a description was obtained by Khot, Minzer and Safra, a breakthrough that completed the proof of the 2-to-2 conjecture. In this paper, we formulate a conjecture for higher dimensions, and prove it in an important special case. Also, we identify a statement about η-closed sets in Cayley graphs on arbitrary finite Abelian groups that implies the conjecture and can be considered as a "highly asymmetric Balog-Szemerédi-Gowers theorem" when it holds. We conclude the paper by showing that this statement is not true for an arbitrary Cayley graph. It remains to decide whether the statement can be proved for the Cayley graph Γ.
doi:10.17863/cam.51447 fatcat:rvjyq6756zf65lxk3sxl6wpf7y