Counting complements in the partition lattice, and hypertrees

DOI10.1016/0097-3165(91)90012-6zbMath0762.05003OpenAlexW2060767694MaRDI QIDQ1176383

Daniel Grieser

Publication date: 25 June 1992

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(91)90012-6

zbMATH Keywords

complementshypertreespartition lattice

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Hypergraphs (05C65)

Related Items (2)

Chains, antichains, and complements in infinite partition lattices ⋮ Hypergraphs and a functional equation of Bouwkamp and de Bruijn

Cites Work

• The partition polynomial of a finite set system
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting complements in the partition lattice, and hypertrees