1 paper
Gábor Elek, Ãdám Timár
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many Følner sets, and we call it strongly almost finite, if the tiling can…