A Bijective Proof of a Theorem of Knuth

DOI10.1017/S0963548310000192zbMath1221.05174arXiv0910.3442OpenAlexW2125944388WikidataQ114116560 ScholiaQ114116560MaRDI QIDQ3068810

Shaunak Kishore, Hoda Bidkhori

Publication date: 17 January 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

number of spanning trees

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (6)

Oriented spanning trees and stationary distribution of digraphs ⋮ On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs ⋮ Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields ⋮ Distributed bearing vector estimation in multi-agent networks ⋮ Miscellaneous Digraph Classes ⋮ Cyclic arrangements with minimum modulo \(m\) winding numbers

Cites Work

• Chip-firing and the critical group of a graph
• The critical group of a threshold graph
• Critical groups for complete multipartite graphs and Cartesian products of complete graphs
• Oriented subtrees of an arc digraph

This page was built for publication: A Bijective Proof of a Theorem of Knuth