1 paper
Péter Mester, Ádám Timár
We construct a unimodular random rooted graph with maximal degree d≥3 and upper growth rate d−1, which does not have a growth rate. Abért, Fraczyk and Hayes showed that for…