A minimal cutset of the boolean lattice with almost all members

Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

Two almost explicit constructions are given satisfying the title.

Original languageEnglish
Pages (from-to)327-332
Number of pages6
JournalGraphs and Combinatorics
Volume5
Issue number1
DOIs
Publication statusPublished - Dec 1 1989

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'A minimal cutset of the boolean lattice with almost all members'. Together they form a unique fingerprint.

  • Cite this