Counting graphs with different numbers of spanning trees through the counting of prime partitions

DOI10.1007/s10587-014-0079-8zbMath1340.05006arXiv1210.5704OpenAlexW2044153255MaRDI QIDQ2940619

Jernej Azarija

Publication date: 27 January 2015

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.5704

zbMATH Keywords

asymptoticnumber of spanning treesprime partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Asymptotic enumeration (05A16)

Cites Work

• Unnamed Item
• Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees
• On the Minimal Graph with a Given Number of Spanning Trees
• SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS

This page was built for publication: Counting graphs with different numbers of spanning trees through the counting of prime partitions