A finite nonempty vertex set in an amenable graph is a Følner set with tolerance if its external boundary has size at most times its volume. A graph Følner sequence consists of such sets with tolerances tending to zero. For a bounded-degree graph, every fixed-thickness boundary layer also has negligible relative volume along this sequence.
New to topics? Read the docs here!