Alternative proof of upper bound of spanning trees in a graph

Research output: Working paperPreprint

3 Downloads (Pure)

Abstract

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs.
Translated title of the contributionАльтернативное доказательство верхней оценки количества остовных деревьев в графе
Original languageEnglish
Pages1-4
Number of pages4
StatePublished - 27 Feb 2021

Fingerprint

Dive into the research topics of 'Alternative proof of upper bound of spanning trees in a graph'. Together they form a unique fingerprint.

Cite this