MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I feel a little embarrassed to be asking this question here, since I think it should be much easier than I'm making it, but here goes:

Given a finite poset P, does there necessarily exist some chain that intersects every maximal antichain? (Note: By maximal antichain, I mean that there's no antichain strictly containing our antichain.) The answer seems to be "no" for infinite posets, but I can't find either a reference or a proof when it comes to finite posets.

Sorry if this is an undergrad-homework-level problem...

share|cite|improve this question
On the other hand, there does exists a chain that intersects every antichain of maximum size. – Richard Stanley Feb 5 '11 at 4:00
up vote 5 down vote accepted


Consider the poset of subsets of {x,y,z} under inclusion. The maximal chain Ø, {x}, {x,y}, {x, y, z} does not intersect every maximal antichain: it misses the maximal antichain {y}, {x,z}. By symmetry every other maximal chain also misses some maximal antichain.

share|cite|improve this answer
Oh, duh! I think I actually had this counterexample myself the other day, but didn't realize that it was important. Hmm, okay... I need to think about this some more, then. Thanks! – Harrison Brown Oct 20 '09 at 6:41

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.