Abstract
In this note we give a short proof that graphs having no linearly small Følner sets can be partitioned into a union of expanders. We use this fact to prove a partition result for graphs admitting linearly small maximal Følner sets and we deduce that a family of such graphs must contain a family of expanders. We also show that the existence of partitions into expanders is a quasi-isometry invariant.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.