I am a graduate student and I am having a course on discrete mathematics.I am just introduced to Dilworth's theorem which states that:
The minimum number of disjoint chains required to cover a finite poset is equal to the maximum size of antichain in that poset.
I want to understand this theorem by means of examples.Can someone illustrate an example where I can clearly see the equality?I want to get a feel that this should be true.But,I am unable to do so.