A Bijective Proof of a Theorem of Knuth
From MaRDI portal
Publication:3068810
DOI10.1017/S0963548310000192zbMath1221.05174arXiv0910.3442WikidataQ114116560 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
05A15: Exact enumeration problems, generating functions
05C30: Enumeration in graph theory
05C20: Directed graphs (digraphs), tournaments
05C76: Graph operations (line graphs, products, etc.)
Related Items
On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs, Oriented spanning trees and stationary distribution of digraphs, Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields, Cyclic arrangements with minimum modulo \(m\) winding numbers, Distributed bearing vector estimation in multi-agent networks, Miscellaneous Digraph Classes
Cites Work