Erdős Problem 528

### What is the conjecture

https://www.erdosproblems.com/528

Let $f(n,k)$ count the number of self-avoiding walks of $n$ steps (beginning at the origin) in $\mathbb{Z}^k$ (i.e. those walks which do not intersect themselves). Determine
$$C_k=\lim_{n\to\infty}f(n,k)^{1/n}.$$

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else