OurBigBook About$ Donate
 Sign in Sign up

Følner set (Wn​)

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Graph Amenable graph
2026-10-14  0 By others on same topic  0 Discussions Create my own version
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.

 Ancestors (7)

  1. Amenable graph
  2. Graph
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (3)

  • Amenable graph
  • Layer-cake extraction of Følner sets
  • Past exam of the mathematics course of the University of Cambridge / 2009 / iii / Paper 15 / 3 / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook