Maximal antichains of subsets II: Constructions

06/04/2021
∙
by   Jerrold R. Griggs, et al.
∙
0
∙

This is the second in a sequence of three papers investigating the question for which positive integers m there exists a maximal antichain of size m in the Boolean lattice B_n (the power set of [n]:={1,2,…,n}, ordered by inclusion). In the previous paper we characterized those m between n⌈ n/2⌉-⌈ n/2⌉^2 and the maximum size n⌈ n/2 ⌉ that are not sizes of maximal antichains. In this paper we show that all smaller m are sizes of maximal antichains.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment