首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Some partitions associated with a partially ordered set
Authors:Curtis Greene
Institution:Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA
Abstract:For any partially ordered set P, let dk(P)(d?k(P)) denote the cardinality of the largest subset of P obtained by taking the union of k antichains (chains). Then there exists a partition Δ = {Δl ? Δ2 > … ? Δl} of | P | such that dk(P) = Δ1 + Δ2 + … + Δk and d?k(P) = Δ11 + Δ21 + … + Δk1 for each k, where Δ1 denotes the partition conjugate to Δ. This result can be used to prove a general class of “Dilworth-type” theorems for subfamilies of P.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号