17 citations · 61 across the 21 of their papers we have counts for
1 paper · 1 filter
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…