Research RepositorySaint Petersburg State University
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11701/30487| Title: | Sharp upper bounds for number of spanning trees in graphs |
| Other Titles: | Точные оценки на количество остовных деревьев в графах |
| Authors: | Полянский Александр Андреевич Polanskij Aleksandr Andreevic Челпанов Константин Вячеславович Celpanov Konstantin Vaceslavovic Петров Федор Владимирович Petrov Fedor Vladimirovic |
| Issue Date: | 2021 |
| URI: | http://hdl.handle.net/11701/30487 |
| Appears in Collections: | BACHELOR STUDIES |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| diploma_rus.pdf | Article | 339,78 kB | Adobe PDF | View/Open |
| reviewSV_otz_KC.pdf | ReviewSV | 96,72 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.