On the composition and decomposition of clutters

DOI10.1016/0095-8956(71)90033-5zbMath0201.22406OpenAlexW2042261605MaRDI QIDQ2540812

Billera, Louis J.

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1016/0095-8956(71)90033-5

Related Items (12)

Two representations of finite ordered sets ⋮ The complexity of modular decomposition of Boolean functions ⋮ A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ On the X-join decomposition for undirected graphs ⋮ Partitive hypergraphs ⋮ Minimum self-dual decompositions of positive dual-minor Boolean functions ⋮ Two algorithms for determining a minimum independent dominating set ⋮ A composition for matroids ⋮ Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales ⋮ On the length-width inequality for compound clutters ⋮ Decomposing 1-Sperner hypergraphs ⋮ 1-intersecting families

Cites Work

• On the length-width inequality for compound clutters
• Bottleneck extrema
• Modules of Coherent Binary Systems
• Clutter Decomposition and Monotonic Boolean Functions*
• Unnamed Item
• Unnamed Item

This page was built for publication: On the composition and decomposition of clutters