[hal-01184366] Excluded subposets in the Boolean lattice

We are looking for the maximum number of subsets of an n-element set not containing 4 distinct subsets satisfying A ⊂B, C ⊂B, C ⊂D. It is proved that this number is at least the number of the \lfloor n / 2\rfloor -element sets times 1+2 / n, on the other hand an upper bound is given with 4 replaced by the value 2.

from HAL : Dernières publications http://ift.tt/1DQQO8p