On chain and antichain families of a partially ordered set

Research output: Contribution to journalArticle

71 Citations (Scopus)

Abstract

A common generalization of the theorems of Greene and Greene and Kleitman is presented. This yields some insight into the relation of optimal chain and antichain families of a partially ordered set. The fundamental device is the minimal cost flow algorithm of Ford and Fulkerson.

Original languageEnglish
Pages (from-to)176-184
Number of pages9
JournalJournal of Combinatorial Theory. Series B
Volume29
Issue number2
DOIs
Publication statusPublished - Jan 1 1980

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'On chain and antichain families of a partially ordered set'. Together they form a unique fingerprint.

  • Cite this