The density of a maximum minimal cut in the subset lattice of a finite set is almost one

DOI10.1016/0012-365X(93)90010-QzbMath0787.05059OpenAlexW2062290700MaRDI QIDQ1313971

Weixuan Li, Feng Shi

Publication date: 26 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90010-q

zbMATH Keywords

densityHasse diagramminimal cutsubset latticemaximum minimal cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (3)

Edge‐cutsets in the directed hypercube ⋮ On the \(f\)-vectors of cutsets in the Boolean lattice ⋮ Unnamed Item

This page was built for publication: The density of a maximum minimal cut in the subset lattice of a finite set is almost one