scientific article; zbMATH DE number 841663

zbMATH Open0836.05040MaRDI QIDQ4863517FDOQ4863517

Authors: Dan Pritikin 

Publication date: 22 April 1996

Title of this publication is not available (Why is that?)

Recommendations

• A bijective proof of a theorem of Knuth
• A bijective proof of Vershik's relations for the Kostka numbers
• Bijective proofs of formulas with \((-1)^n\)
• scientific article; zbMATH DE number 5014508
• A hypergeometric proof that \(\mathsf{Iso}\) is bijective
• Bijective proof of the partition identity \(C_{2,2}(n)= D_{2,2}(n)\) of M. V. Subbarao
• A bijective proof of a Touchard-Riordan formula
• Bijective proof of the partition identity \(C_{2,r}(n)= D_{2,r}(n)\) of M. V. Subbarao
• Bijective proof of the new partition identity \(A_{4,2,2}^0(n)= B_{4,2,2}(n)\)
• A bijective proof of Borchardt's identity

zbMATH Keywords

spanning treescomplete multipartite graphslabelled graphCayley's formula

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cited In (6)

• Title not available (Why is that?)
• On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
• Colored Prüfer codes for \(k\)-edge colored trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• A bijective proof of a theorem of Knuth

This page was built for publication:

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