Bencs, Ferenc and Csíkvári, Péter (2023) Upper bound for the number of spanning forests of regular graphs. EUROPEAN JOURNAL OF COMBINATORICS, 110. ISSN 0195-6698
|
Text
1-s2.0-S0195669822001731-main.pdf Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (424kB) | Preview |
Official URL: https://doi.org/10.1016/j.ejc.2022.103677
| Item Type: | Article |
|---|---|
| Additional Information: | Export Date: 10 February 2023 CODEN: EJOCD Funding details: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, NKFIH, KKP-133921 Funding text 1: The first author is supported by the NKFIH (National Research, Development and Innovation Office, Hungary) grant KKP-133921 . The second author is partially supported by the Counting in Sparse Graphs Lendület Research Group, Hungary . |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Apr 2024 11:01 |
| Last Modified: | 05 Apr 2024 11:01 |
| URI: | https://real.mtak.hu/id/eprint/191860 |
Actions (login required)
 |
Edit Item |
