A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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 ofdoi:10.17863/cam.51447 fatcat:rvjyq6756zf65lxk3sxl6wpf7y