On chain and antichain families of a partially ordered set

Research output: Contribution to journalArticle

70 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

Fingerprint

Antichain
Partially Ordered Set
Costs
Theorem
Generalization
Family

ASJC Scopus subject areas

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

Cite this

On chain and antichain families of a partially ordered set. / Frank, A.

In: Journal of Combinatorial Theory. Series B, Vol. 29, No. 2, 01.01.1980, p. 176-184.

Research output: Contribution to journalArticle

@article{5671f843605b4254aa9796c13ae64806,
title = "On chain and antichain families of a partially ordered set",
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.",
author = "A. Frank",
year = "1980",
month = "1",
day = "1",
doi = "10.1016/0095-8956(80)90079-9",
language = "English",
volume = "29",
pages = "176--184",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - On chain and antichain families of a partially ordered set

AU - Frank, A.

PY - 1980/1/1

Y1 - 1980/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34247872179&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247872179&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(80)90079-9

DO - 10.1016/0095-8956(80)90079-9

M3 - Article

VL - 29

SP - 176

EP - 184

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -