On the \(f\)-vectors of cutsets in the Boolean lattice

DOI10.1006/jcta.2000.3066zbMath0981.06001OpenAlexW2027985972MaRDI QIDQ5929842

No author found.

Publication date: 18 March 2002

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

Full work available at URL: https://doi.org/10.1006/jcta.2000.3066

zbMATH Keywords

profile\(f\)-vectorBoolean latticecutset

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Boolean algebras (Boolean rings) (06E99)

Related Items (2)

Edge‐cutsets in the directed hypercube ⋮ Unnamed Item

Cites Work

• Cutsets of Boolean lattices
• A minimal cutset of the Boolean lattice with almost all members
• Minimum cutsets for an element of a Boolean lattice
• Games of chains and cutsets in the Boolean lattice
• The density of a maximum minimal cut in the subset lattice of a finite set is almost one
• On uniform \(f\)-vectors of cutsets in the truncated Boolean lattice
• Matchings, cutsets, and chain partitions in graded posets
• Long symmetric chains in the Boolean lattice
• Maximal Chains and Antichains in Boolean Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the \(f\)-vectors of cutsets in the Boolean lattice