Spanning retracts of a partially ordered set

D. Duffus, I. Rival, M. Simonovits

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

Two general kinds of subsets of a partially ordered set P are always retracts of P: (1) every maximal chain of P is a retract; (2) in P, every isometric, spanning subset of length one with no crowns is a retract. It follows that in a partially ordered set P with the fixed point property, every maximal chain of P is complete and every isometric, spanning fence of P is finite.

Original languageEnglish
Pages (from-to)1-7
Number of pages7
JournalDiscrete Mathematics
Volume32
Issue number1
DOIs
Publication statusPublished - 1980

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Spanning retracts of a partially ordered set'. Together they form a unique fingerprint.

  • Cite this