Bencs–Csikvári conjecture on spanning forests of regular graphs
Let be a --regular graph on vertices, and let denote its number of spanning forests. Bencs–Csikvári conjecture.
This is the proposed sharp analogue for spanning forests of McKay's upper bound for spanning trees; the abstract states that equality in the exponential base would make the right-hand side best possible. The source gives no resolution of the conjecture.
References
- Ferenc Bencs and Péter Csikvári, “Upper bound for the number of spanning forests of regular graphs”, arXiv:2105.06801 (2022).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.