On the lattice of maximum-sized antichains of a finite poset

DOI10.1007/BF01194515zbMATH Open0524.06003MaRDI QIDQ585231FDOQ585231

Authors: K. M. Koh 

Publication date: 1983

Published in: Algebra Universalis (Search for Journal in Brave)

zbMATH Keywords

distributive latticemaximum-sized antichains

Mathematics Subject Classification ID

Partial orders, general (06A06) Structure and representation theory of distributive lattices (06D05)

Cites Work

• A decomposition theorem for partially ordered sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximal sized antichains in partial orders
• An application of Dilworth's lattice of maximal antichains

Cited In (9)

• Antichain based semantics for rough sets
• Algebraic methods for granular rough sets
• An extremal problem on crossing vectors.
• On the representations of finite distributive lattices
• Dialectical Rough Sets, Parthood and Figures of Opposition-I
• Algebraic representation, dualities and beyond
• Lattices of crosscuts
• Maximum-sized antichains in minimal posets
• On generation of finite posets by meet-irreducibles

This page was built for publication: On the lattice of maximum-sized antichains of a finite poset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q585231)