On the Erd\"os-Ko-Rado Theorem on Finite Sets

Jun Wang
Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, P. R. China

Abstract     Full Text  PDF

Erd\"os, Ko and Rado proved in 1961 that a family of pairwise intersecting $k$-subsets of an $n$-set cannot have more members than a maximal (antichain) of $k$-subsets all of which contain a given element $a$, say, provided $k\leq \lfloor\frac{n}{2}\rfloor$. In this talk we try to discuss this theorem in ranked posets. Some examples and problems will be presented.