``Bicoverings of a finite set by generating function methods

DOI10.1016/0097-3165(80)90066-7zbMath0478.05003OpenAlexW2032292037MaRDI QIDQ1160619

S. Singh

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(80)90066-7

zbMATH Keywords

set bicoverings

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items

A combinatorial proof of the multivariable Lagrange inversion formula, Symmetric functions and P-recursiveness

Cites Work

• On elementary calculus and the Good formula
• The Number of Partitions of a Set
• Unnamed Item
• Unnamed Item