Binomial identities generated by counting spanning trees.

MaRDI QIDQ5310247zbMATH OpenFDO

Authors Thom Porter

Publication date 21 September 2007

zbMATH Keywords

binomial identityinclusion-exclusionspanning tree

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Trees (05C05) Enumeration in graph theory (05C30)

Recommendations

• Some applications of spanning trees in \(K_{s,t}\)
• On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
• scientific article; zbMATH DE number 4142059
• The number of spanning trees in generalized complete multipartite graphs of Fan-type
• Enumeration for no-trivial spanning forests of complete bipartite graphs.

Cited in

(3)

• Trees and Power-Sums
• Some applications of spanning trees in \(K_{s,t}\)
• Combinatorial interpretations of spanning tree identities

This page was built for publication: Binomial identities generated by counting spanning trees.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310247)