PROVED
This has been solved in the affirmative.
Let $G$ be a regular graph with $2n$ vertices and degree $n+1$. Must $G$ have $\gg 2^{2n}$ subsets that are spanned by a cycle?
A problem of Erdős and Faudree. Erdős writes 'it is easy to see' that there are at least $(\frac{1}{2}+o(1))2^{2n}$ sets that are not on a cycle.
If the regularity condition is replaced by minimum degree $n+1$ then the answer is no (consider $K_{n,n}$ with a spanning star in each part). Similarly this is false with degree $n$, as $K_{n,n}$ shows.
This has been resolved by Draganić, Keevash, and Müyesser
[DKM25], who prove the asymptotically tight result that there are at least\[(\tfrac{1}{2}+o(1))2^{2n}\]subsets which are spanned by a cycle.
View the LaTeX source
When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:
T. F. Bloom, Erdős Problem #622, https://www.erdosproblems.com/622, accessed 2026-01-16