Upper bound for the number of spanning forests of regular graphs

Ferenc Bencs, Péter Csikvári. Upper bound for the number of spanning forests of regular graphs. Eur. J. Comb., 110:103677, May 2023. [doi]

@article{BencsC23,
  title = {Upper bound for the number of spanning forests of regular graphs},
  author = {Ferenc Bencs and Péter Csikvári},
  year = {2023},
  month = {May},
  doi = {10.1016/j.ejc.2022.103677},
  url = {https://doi.org/10.1016/j.ejc.2022.103677},
  researchr = {https://researchr.org/publication/BencsC23},
  cites = {0},
  citedby = {0},
  journal = {Eur. J. Comb.},
  volume = {110},
  pages = {103677},
}